./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-dietlibc/strlcpy.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-dietlibc/strlcpy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:34:17,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:34:17,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:34:17,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:34:17,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:34:17,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:34:17,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:34:17,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:34:17,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:34:17,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:34:17,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:34:17,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:34:17,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:34:17,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:34:17,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:34:17,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:34:17,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:34:17,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:34:17,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:34:17,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:34:17,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:34:17,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:34:17,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:34:17,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:34:17,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:34:17,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:34:17,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:34:17,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:34:17,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:34:17,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:34:17,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:34:17,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:34:17,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:34:17,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:34:17,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:34:17,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:34:17,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:34:17,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:34:17,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:34:17,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:34:17,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:34:17,237 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-11-18 20:34:17,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:34:17,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:34:17,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:34:17,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:34:17,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:34:17,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:34:17,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:34:17,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:34:17,286 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:34:17,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:34:17,287 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:34:17,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:34:17,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:34:17,288 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:34:17,288 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:34:17,288 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:34:17,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:34:17,289 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:34:17,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:34:17,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:34:17,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:34:17,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:34:17,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:17,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:34:17,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:34:17,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:34:17,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:34:17,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/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_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 [2022-11-18 20:34:17,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:34:17,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:34:17,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:34:17,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:34:17,599 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:34:17,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-dietlibc/strlcpy.i [2022-11-18 20:34:17,688 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/data/022b45c87/3880f13eca27484d8b94f52842fd3787/FLAG56d610b73 [2022-11-18 20:34:18,389 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:34:18,389 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2022-11-18 20:34:18,413 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/data/022b45c87/3880f13eca27484d8b94f52842fd3787/FLAG56d610b73 [2022-11-18 20:34:18,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/data/022b45c87/3880f13eca27484d8b94f52842fd3787 [2022-11-18 20:34:18,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:34:18,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:34:18,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:18,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:34:18,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:34:18,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:18" (1/1) ... [2022-11-18 20:34:18,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a23ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:18, skipping insertion in model container [2022-11-18 20:34:18,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:18" (1/1) ... [2022-11-18 20:34:18,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:34:18,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:34:19,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:19,185 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:34:19,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:19,291 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:34:19,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19 WrapperNode [2022-11-18 20:34:19,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:19,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:19,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:34:19,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:34:19,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,367 INFO L138 Inliner]: procedures = 113, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2022-11-18 20:34:19,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:19,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:34:19,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:34:19,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:34:19,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:34:19,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:34:19,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:34:19,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:34:19,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (1/1) ... [2022-11-18 20:34:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:19,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:34:19,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:34:19,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:34:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:34:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:34:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:34:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:34:19,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:34:19,563 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:34:19,565 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:34:19,930 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:34:19,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:34:19,937 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:34:19,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:19 BoogieIcfgContainer [2022-11-18 20:34:19,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:34:19,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:34:19,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:34:19,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:34:19,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:18" (1/3) ... [2022-11-18 20:34:19,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3e30c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:19, skipping insertion in model container [2022-11-18 20:34:19,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:19" (2/3) ... [2022-11-18 20:34:19,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3e30c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:19, skipping insertion in model container [2022-11-18 20:34:19,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:19" (3/3) ... [2022-11-18 20:34:19,963 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcpy.i [2022-11-18 20:34:19,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:34:19,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-18 20:34:20,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:34:20,087 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68a31dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:34:20,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-18 20:34:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 20:34:20,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:20,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 20:34:20,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash 925686, now seen corresponding path program 1 times [2022-11-18 20:34:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:20,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114638108] [2022-11-18 20:34:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114638108] [2022-11-18 20:34:20,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114638108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:34:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147909972] [2022-11-18 20:34:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:20,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:34:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:34:20,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:34:20,436 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:20,543 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-11-18 20:34:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:34:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 20:34:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:20,581 INFO L225 Difference]: With dead ends: 37 [2022-11-18 20:34:20,581 INFO L226 Difference]: Without dead ends: 34 [2022-11-18 20:34:20,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:34:20,588 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:20,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-18 20:34:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-18 20:34:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-18 20:34:20,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 4 [2022-11-18 20:34:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:20,629 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-18 20:34:20,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-18 20:34:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 20:34:20,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:20,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 20:34:20,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:34:20,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-18 20:34:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:20,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600885506] [2022-11-18 20:34:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600885506] [2022-11-18 20:34:20,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600885506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:34:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710799075] [2022-11-18 20:34:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:20,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:34:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:34:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:34:20,813 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:20,867 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-11-18 20:34:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:34:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 20:34:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:20,872 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:34:20,872 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 20:34:20,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:34:20,879 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:20,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 20:34:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-18 20:34:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-18 20:34:20,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 4 [2022-11-18 20:34:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:20,892 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-18 20:34:20,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-18 20:34:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 20:34:20,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:20,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 20:34:20,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:34:20,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-11-18 20:34:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:20,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441495226] [2022-11-18 20:34:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441495226] [2022-11-18 20:34:21,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441495226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:21,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:21,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:34:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862982665] [2022-11-18 20:34:21,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:21,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:21,157 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:21,204 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-11-18 20:34:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 20:34:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:21,206 INFO L225 Difference]: With dead ends: 34 [2022-11-18 20:34:21,206 INFO L226 Difference]: Without dead ends: 34 [2022-11-18 20:34:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:21,208 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:21,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 62 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-18 20:34:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-18 20:34:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-11-18 20:34:21,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 4 [2022-11-18 20:34:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:21,213 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-11-18 20:34:21,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-11-18 20:34:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:34:21,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:21,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:21,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:34:21,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782705, now seen corresponding path program 1 times [2022-11-18 20:34:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191183662] [2022-11-18 20:34:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:21,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191183662] [2022-11-18 20:34:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191183662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:21,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:21,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:34:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087364725] [2022-11-18 20:34:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:21,367 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:21,414 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-18 20:34:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 20:34:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:21,415 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:34:21,415 INFO L226 Difference]: Without dead ends: 32 [2022-11-18 20:34:21,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:21,422 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:21,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-18 20:34:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-18 20:34:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-18 20:34:21,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2022-11-18 20:34:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:21,433 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-18 20:34:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-18 20:34:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:34:21,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:21,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:21,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:34:21,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227602, now seen corresponding path program 1 times [2022-11-18 20:34:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:21,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723056541] [2022-11-18 20:34:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723056541] [2022-11-18 20:34:21,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723056541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:21,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:21,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458037277] [2022-11-18 20:34:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:21,892 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2022-11-18 20:34:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:22,031 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-18 20:34:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 [2022-11-18 20:34:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:22,035 INFO L225 Difference]: With dead ends: 49 [2022-11-18 20:34:22,035 INFO L226 Difference]: Without dead ends: 49 [2022-11-18 20:34:22,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:22,038 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:22,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 71 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-18 20:34:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2022-11-18 20:34:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.64) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-18 20:34:22,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 10 [2022-11-18 20:34:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:22,044 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-18 20:34:22,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2022-11-18 20:34:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-18 20:34:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:34:22,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:22,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:22,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:34:22,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227601, now seen corresponding path program 1 times [2022-11-18 20:34:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:22,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201915074] [2022-11-18 20:34:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201915074] [2022-11-18 20:34:22,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201915074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:22,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:22,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:34:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182120444] [2022-11-18 20:34:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:22,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:22,205 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2022-11-18 20:34:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:22,267 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-18 20:34:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 [2022-11-18 20:34:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:22,270 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:34:22,270 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 20:34:22,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:22,273 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:22,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 20:34:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-18 20:34:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-18 20:34:22,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2022-11-18 20:34:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:22,285 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-18 20:34:22,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2022-11-18 20:34:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-18 20:34:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:34:22,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:22,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:22,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:34:22,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786096, now seen corresponding path program 1 times [2022-11-18 20:34:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197962619] [2022-11-18 20:34:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197962619] [2022-11-18 20:34:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197962619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:22,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:22,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:34:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148370476] [2022-11-18 20:34:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:22,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:22,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:22,443 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:22,481 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-11-18 20:34:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:22,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:34:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:22,484 INFO L225 Difference]: With dead ends: 32 [2022-11-18 20:34:22,485 INFO L226 Difference]: Without dead ends: 32 [2022-11-18 20:34:22,485 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 [2022-11-18 20:34:22,487 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:22,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 26 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-18 20:34:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-18 20:34:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-18 20:34:22,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-11-18 20:34:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:22,503 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-18 20:34:22,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-18 20:34:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:34:22,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:22,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:22,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:34:22,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786095, now seen corresponding path program 1 times [2022-11-18 20:34:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:22,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583903316] [2022-11-18 20:34:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:22,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583903316] [2022-11-18 20:34:22,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583903316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:22,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945479484] [2022-11-18 20:34:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:22,879 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:22,992 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-18 20:34:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:34:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:34:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:22,995 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:34:22,995 INFO L226 Difference]: Without dead ends: 44 [2022-11-18 20:34:22,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:34:22,997 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:22,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-18 20:34:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2022-11-18 20:34:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-18 20:34:23,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-11-18 20:34:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:23,014 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-18 20:34:23,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-11-18 20:34:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:34:23,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:23,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:23,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:34:23,023 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617326, now seen corresponding path program 1 times [2022-11-18 20:34:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:23,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951946407] [2022-11-18 20:34:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:23,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951946407] [2022-11-18 20:34:23,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951946407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:23,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:23,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409286967] [2022-11-18 20:34:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:23,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:23,160 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:23,216 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-11-18 20:34:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:34:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:23,219 INFO L225 Difference]: With dead ends: 34 [2022-11-18 20:34:23,219 INFO L226 Difference]: Without dead ends: 34 [2022-11-18 20:34:23,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:23,220 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:23,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-18 20:34:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-18 20:34:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.5) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-11-18 20:34:23,224 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-11-18 20:34:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:23,225 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-11-18 20:34:23,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-11-18 20:34:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:34:23,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:23,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:34:23,228 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617325, now seen corresponding path program 1 times [2022-11-18 20:34:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:23,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340434748] [2022-11-18 20:34:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340434748] [2022-11-18 20:34:23,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340434748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:23,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:23,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:34:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547303523] [2022-11-18 20:34:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:34:23,441 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:23,579 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-11-18 20:34:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:34:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:34:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:23,580 INFO L225 Difference]: With dead ends: 45 [2022-11-18 20:34:23,580 INFO L226 Difference]: Without dead ends: 45 [2022-11-18 20:34:23,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:34:23,581 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 112 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:23,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-18 20:34:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-11-18 20:34:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-18 20:34:23,585 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-11-18 20:34:23,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:23,585 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-18 20:34:23,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-11-18 20:34:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:34:23,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:23,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:23,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:34:23,587 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1358038030, now seen corresponding path program 1 times [2022-11-18 20:34:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:23,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165429671] [2022-11-18 20:34:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:23,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165429671] [2022-11-18 20:34:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165429671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:23,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:23,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:34:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954339044] [2022-11-18 20:34:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:34:23,732 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:23,770 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-11-18 20:34:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 20:34:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:23,771 INFO L225 Difference]: With dead ends: 34 [2022-11-18 20:34:23,772 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 20:34:23,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:34:23,773 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:23,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 20:34:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-18 20:34:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-18 20:34:23,775 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2022-11-18 20:34:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:23,776 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-18 20:34:23,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-18 20:34:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:34:23,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:23,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:34:23,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243700, now seen corresponding path program 1 times [2022-11-18 20:34:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376830009] [2022-11-18 20:34:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:23,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376830009] [2022-11-18 20:34:23,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376830009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:23,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:23,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:34:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439360067] [2022-11-18 20:34:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:23,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:23,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:23,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:23,881 INFO L87 Difference]: Start difference. First operand 31 states and 37 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) [2022-11-18 20:34:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:23,910 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-11-18 20:34:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:23,911 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 [2022-11-18 20:34:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:23,911 INFO L225 Difference]: With dead ends: 30 [2022-11-18 20:34:23,911 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 20:34:23,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:23,912 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:23,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 20:34:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-18 20:34:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-18 20:34:23,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2022-11-18 20:34:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:23,926 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-18 20:34:23,927 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) [2022-11-18 20:34:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-18 20:34:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:34:23,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:23,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:23,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:34:23,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243701, now seen corresponding path program 1 times [2022-11-18 20:34:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:23,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912056034] [2022-11-18 20:34:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912056034] [2022-11-18 20:34:24,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912056034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:24,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:24,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550843400] [2022-11-18 20:34:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:24,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:24,171 INFO L87 Difference]: Start difference. First operand 30 states and 36 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) [2022-11-18 20:34:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,254 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-18 20:34:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:24,255 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 [2022-11-18 20:34:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,256 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:34:24,256 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 20:34:24,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:24,259 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:24,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 20:34:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-18 20:34:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-18 20:34:24,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 12 [2022-11-18 20:34:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:24,264 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-18 20:34:24,264 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) [2022-11-18 20:34:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-18 20:34:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:34:24,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:24,267 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:34:24,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 824988573, now seen corresponding path program 1 times [2022-11-18 20:34:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:24,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186146889] [2022-11-18 20:34:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:34:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186146889] [2022-11-18 20:34:24,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186146889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:24,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:24,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223864768] [2022-11-18 20:34:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:24,440 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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) [2022-11-18 20:34:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,498 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-11-18 20:34:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:24,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 15 [2022-11-18 20:34:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,499 INFO L225 Difference]: With dead ends: 54 [2022-11-18 20:34:24,499 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 20:34:24,500 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 [2022-11-18 20:34:24,501 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:24,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 20:34:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2022-11-18 20:34:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-18 20:34:24,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-11-18 20:34:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:24,507 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-18 20:34:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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) [2022-11-18 20:34:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-18 20:34:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:34:24,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:24,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:24,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:34:24,510 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1813342470, now seen corresponding path program 1 times [2022-11-18 20:34:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:24,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307804249] [2022-11-18 20:34:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:34:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:24,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307804249] [2022-11-18 20:34:24,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307804249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:24,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:24,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047211858] [2022-11-18 20:34:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:24,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:24,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:24,698 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,724 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-11-18 20:34:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-18 20:34:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,725 INFO L225 Difference]: With dead ends: 38 [2022-11-18 20:34:24,726 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 20:34:24,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:24,729 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:24,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 20:34:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-11-18 20:34:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-18 20:34:24,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 15 [2022-11-18 20:34:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:24,734 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-18 20:34:24,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-18 20:34:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:34:24,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:24,738 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:24,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:34:24,738 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1505046943, now seen corresponding path program 1 times [2022-11-18 20:34:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:24,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452204588] [2022-11-18 20:34:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:34:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:24,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452204588] [2022-11-18 20:34:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452204588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:24,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:24,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364518135] [2022-11-18 20:34:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:24,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:24,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:24,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:24,861 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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) [2022-11-18 20:34:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,888 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-18 20:34:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:24,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 15 [2022-11-18 20:34:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,889 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:34:24,889 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 20:34:24,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:24,890 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:24,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:34:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 20:34:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-18 20:34:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:34:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-18 20:34:24,894 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2022-11-18 20:34:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:24,895 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-18 20:34:24,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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) [2022-11-18 20:34:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-18 20:34:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:34:24,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:24,896 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:24,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:34:24,897 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-18 20:34:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -596495872, now seen corresponding path program 1 times [2022-11-18 20:34:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:24,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387167877] [2022-11-18 20:34:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:34:24,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:34:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:34:24,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:34:24,986 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:34:24,988 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2022-11-18 20:34:24,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2022-11-18 20:34:24,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2022-11-18 20:34:24,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2022-11-18 20:34:24,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2022-11-18 20:34:24,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2022-11-18 20:34:24,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2022-11-18 20:34:24,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2022-11-18 20:34:24,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2022-11-18 20:34:24,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2022-11-18 20:34:24,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2022-11-18 20:34:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:34:24,996 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:25,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:34:25,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:34:25 BoogieIcfgContainer [2022-11-18 20:34:25,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:34:25,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:34:25,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:34:25,062 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:34:25,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:19" (3/4) ... [2022-11-18 20:34:25,065 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:34:25,122 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:34:25,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:34:25,123 INFO L158 Benchmark]: Toolchain (without parser) took 6456.77ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 104.9MB in the beginning and 107.9MB in the end (delta: -2.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,124 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:34:25,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.10ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 106.3MB in the end (delta: -1.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.74ms. Allocated memory is still 138.4MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,125 INFO L158 Benchmark]: Boogie Preprocessor took 26.36ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 103.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,125 INFO L158 Benchmark]: RCFGBuilder took 544.21ms. Allocated memory is still 138.4MB. Free memory was 103.1MB in the beginning and 89.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,126 INFO L158 Benchmark]: TraceAbstraction took 5106.87ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 89.0MB in the beginning and 110.0MB in the end (delta: -21.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,126 INFO L158 Benchmark]: Witness Printer took 60.92ms. Allocated memory is still 172.0MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:34:25,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.10ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 106.3MB in the end (delta: -1.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.74ms. Allocated memory is still 138.4MB. Free memory was 106.3MB in the beginning and 104.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.36ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 103.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.21ms. Allocated memory is still 138.4MB. Free memory was 103.1MB in the beginning and 89.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5106.87ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 89.0MB in the beginning and 110.0MB in the end (delta: -21.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 60.92ms. Allocated memory is still 172.0MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L529] int in_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(in_len < 1) [L531] char* in = __builtin_alloca (in_len); VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=6] [L532] in[in_len-1]=0 VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=6] [L533] int out_len = __VERIFIER_nondet_int(); [L534] COND FALSE !(out_len < 1) [L535] char* out = __builtin_alloca (out_len); [L536] CALL strlcpy(in, out, out_len) [L511] register char *d = dst; [L512] register const char *s = src; [L513] register size_t n = siz; [L514] n != 0 && --n != 0 [L514] EXPR --n [L514] n != 0 && --n != 0 VAL [--n=0, \old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, n != 0 && --n != 0=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L514] COND FALSE !(n != 0 && --n != 0) [L520] COND TRUE n == 0 VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L521] COND TRUE siz != 0 VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L522] *d = '\0' VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L523] EXPR s++ VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:1}, s++=7, s++={3:0}, siz=1, src={3:0}, src={3:0}] [L523] COND TRUE *s++ - 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: 528]: 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, 36 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 448 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 72, 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, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:34:25,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c431a4e-f934-4ae6-a858-8eae7277262f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)