./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:19:52,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:19:52,267 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:19:52,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:19:52,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:19:52,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:19:52,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:19:52,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:19:52,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:19:52,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:19:52,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:19:52,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:19:52,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:19:52,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:19:52,299 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:19:52,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:19:52,300 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:19:52,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:19:52,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:19:52,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:19:52,302 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:19:52,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:19:52,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:19:52,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:19:52,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:19:52,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:19:52,305 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:19:52,306 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:19:52,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:19:52,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:19:52,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:19:52,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:19:52,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:19:52,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:19:52,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:19:52,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:19:52,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:19:52,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:19:52,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:19:52,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:19:52,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:19:52,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2023-11-29 03:19:52,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:19:52,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:19:52,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:19:52,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:19:52,550 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:19:52,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-regression/test05.c [2023-11-29 03:19:55,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:19:55,479 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:19:55,479 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/sv-benchmarks/c/ldv-regression/test05.c [2023-11-29 03:19:55,485 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/data/227478793/63fb949e098943a4b9afb0c8858e82d3/FLAGa57f68b52 [2023-11-29 03:19:55,500 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/data/227478793/63fb949e098943a4b9afb0c8858e82d3 [2023-11-29 03:19:55,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:19:55,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:19:55,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:19:55,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:19:55,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:19:55,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cfdb682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55, skipping insertion in model container [2023-11-29 03:19:55,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:19:55,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:19:55,706 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:19:55,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:19:55,740 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:19:55,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55 WrapperNode [2023-11-29 03:19:55,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:19:55,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:19:55,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:19:55,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:19:55,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,778 INFO L138 Inliner]: procedures = 16, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2023-11-29 03:19:55,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:19:55,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:19:55,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:19:55,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:19:55,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,810 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 9, 3, 3]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 5, 1, 2]. [2023-11-29 03:19:55,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:19:55,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:19:55,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:19:55,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:19:55,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (1/1) ... [2023-11-29 03:19:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:19:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:19:55,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:19:55,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:19:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:19:55,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:19:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:19:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:19:55,990 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:19:55,992 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:19:56,239 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:19:56,280 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:19:56,281 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:19:56,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:19:56 BoogieIcfgContainer [2023-11-29 03:19:56,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:19:56,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:19:56,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:19:56,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:19:56,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:19:55" (1/3) ... [2023-11-29 03:19:56,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a5f436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:19:56, skipping insertion in model container [2023-11-29 03:19:56,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:55" (2/3) ... [2023-11-29 03:19:56,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a5f436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:19:56, skipping insertion in model container [2023-11-29 03:19:56,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:19:56" (3/3) ... [2023-11-29 03:19:56,291 INFO L112 eAbstractionObserver]: Analyzing ICFG test05.c [2023-11-29 03:19:56,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:19:56,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-29 03:19:56,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:19:56,364 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13d85428, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:19:56,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-11-29 03:19:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:19:56,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:56,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:19:56,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:56,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash 3631, now seen corresponding path program 1 times [2023-11-29 03:19:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548353676] [2023-11-29 03:19:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548353676] [2023-11-29 03:19:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548353676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:19:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776429522] [2023-11-29 03:19:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:56,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:56,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:56,695 INFO L87 Difference]: Start difference. First operand has 56 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:56,770 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2023-11-29 03:19:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 03:19:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:56,779 INFO L225 Difference]: With dead ends: 54 [2023-11-29 03:19:56,780 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 03:19:56,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:56,785 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:56,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 22 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 03:19:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 03:19:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 23 states have (on average 2.347826086956522) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-11-29 03:19:56,814 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 2 [2023-11-29 03:19:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:56,814 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-11-29 03:19:56,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-11-29 03:19:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:19:56,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:56,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:19:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:19:56,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:56,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 3632, now seen corresponding path program 1 times [2023-11-29 03:19:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058910150] [2023-11-29 03:19:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058910150] [2023-11-29 03:19:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058910150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:56,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:19:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694156580] [2023-11-29 03:19:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:56,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:56,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:56,957 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,017 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2023-11-29 03:19:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 03:19:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,019 INFO L225 Difference]: With dead ends: 51 [2023-11-29 03:19:57,019 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 03:19:57,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:57,021 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:57,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 03:19:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 03:19:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 23 states have (on average 2.260869565217391) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-11-29 03:19:57,029 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 2 [2023-11-29 03:19:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,029 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-11-29 03:19:57,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2023-11-29 03:19:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 03:19:57,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 03:19:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:19:57,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 112537, now seen corresponding path program 1 times [2023-11-29 03:19:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558601209] [2023-11-29 03:19:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558601209] [2023-11-29 03:19:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558601209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:19:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28303094] [2023-11-29 03:19:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:57,085 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,140 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2023-11-29 03:19:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 03:19:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,142 INFO L225 Difference]: With dead ends: 50 [2023-11-29 03:19:57,142 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 03:19:57,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:57,144 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 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 [2023-11-29 03:19:57,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:19:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 03:19:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 03:19:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.217391304347826) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2023-11-29 03:19:57,150 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 3 [2023-11-29 03:19:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,151 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-11-29 03:19:57,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2023-11-29 03:19:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 03:19:57,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 03:19:57,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:19:57,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash 112538, now seen corresponding path program 1 times [2023-11-29 03:19:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161445158] [2023-11-29 03:19:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161445158] [2023-11-29 03:19:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161445158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:19:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062806501] [2023-11-29 03:19:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:57,224 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,284 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2023-11-29 03:19:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 03:19:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,285 INFO L225 Difference]: With dead ends: 49 [2023-11-29 03:19:57,286 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 03:19:57,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:57,287 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:57,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 22 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 03:19:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 03:19:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2023-11-29 03:19:57,293 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 3 [2023-11-29 03:19:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,294 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-11-29 03:19:57,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2023-11-29 03:19:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:19:57,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:19:57,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:19:57,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 3488626, now seen corresponding path program 1 times [2023-11-29 03:19:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295821767] [2023-11-29 03:19:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295821767] [2023-11-29 03:19:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295821767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:19:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216001929] [2023-11-29 03:19:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:57,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:19:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:19:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:19:57,410 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 5 states, 4 states have (on average 1.0) 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) [2023-11-29 03:19:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,475 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2023-11-29 03:19:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) 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 [2023-11-29 03:19:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,477 INFO L225 Difference]: With dead ends: 48 [2023-11-29 03:19:57,477 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 03:19:57,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:19:57,478 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:57,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 03:19:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-29 03:19:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 2.130434782608696) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2023-11-29 03:19:57,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 4 [2023-11-29 03:19:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,484 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2023-11-29 03:19:57,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) 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) [2023-11-29 03:19:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2023-11-29 03:19:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:19:57,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:19:57,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:19:57,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash 3488627, now seen corresponding path program 1 times [2023-11-29 03:19:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198417782] [2023-11-29 03:19:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198417782] [2023-11-29 03:19:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198417782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:19:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912319285] [2023-11-29 03:19:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:57,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:19:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:19:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:19:57,639 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,693 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2023-11-29 03:19:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:19:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,695 INFO L225 Difference]: With dead ends: 47 [2023-11-29 03:19:57,695 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 03:19:57,695 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 [2023-11-29 03:19:57,696 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:57,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 21 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:19:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 03:19:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-29 03:19:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2023-11-29 03:19:57,701 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 4 [2023-11-29 03:19:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,701 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2023-11-29 03:19:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2023-11-29 03:19:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:19:57,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:19:57,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:19:57,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash 108147388, now seen corresponding path program 1 times [2023-11-29 03:19:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195572089] [2023-11-29 03:19:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195572089] [2023-11-29 03:19:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195572089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:19:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675509590] [2023-11-29 03:19:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:57,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:19:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:19:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:19:57,832 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:57,885 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2023-11-29 03:19:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:19:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:57,887 INFO L225 Difference]: With dead ends: 41 [2023-11-29 03:19:57,887 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 03:19:57,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:19:57,888 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:57,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 14 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:19:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 03:19:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 03:19:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.826086956521739) internal successors, (42), 40 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) [2023-11-29 03:19:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-11-29 03:19:57,892 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 5 [2023-11-29 03:19:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:57,892 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-11-29 03:19:57,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-11-29 03:19:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:19:57,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:57,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:19:57,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:19:57,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:57,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 108147389, now seen corresponding path program 1 times [2023-11-29 03:19:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505340569] [2023-11-29 03:19:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:58,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:58,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505340569] [2023-11-29 03:19:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505340569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:58,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:19:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761217210] [2023-11-29 03:19:58,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:58,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:58,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:58,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:58,064 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:58,119 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2023-11-29 03:19:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:19:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:58,120 INFO L225 Difference]: With dead ends: 35 [2023-11-29 03:19:58,120 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 03:19:58,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:58,121 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:58,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 03:19:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 03:19:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 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) [2023-11-29 03:19:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-11-29 03:19:58,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 5 [2023-11-29 03:19:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:58,126 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-11-29 03:19:58,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-11-29 03:19:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:19:58,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:58,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:58,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:19:58,127 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:58,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -955385408, now seen corresponding path program 1 times [2023-11-29 03:19:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:58,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094652426] [2023-11-29 03:19:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:58,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:58,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094652426] [2023-11-29 03:19:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094652426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:58,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:19:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532079639] [2023-11-29 03:19:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:58,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:19:58,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:19:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:19:58,299 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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) [2023-11-29 03:19:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:58,385 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-11-29 03:19:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:19:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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 [2023-11-29 03:19:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:58,386 INFO L225 Difference]: With dead ends: 33 [2023-11-29 03:19:58,386 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 03:19:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:19:58,387 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 03:19:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 03:19:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-11-29 03:19:58,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 10 [2023-11-29 03:19:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:58,391 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-11-29 03:19:58,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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) [2023-11-29 03:19:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-11-29 03:19:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:19:58,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:58,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:58,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:19:58,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:58,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash -955385409, now seen corresponding path program 1 times [2023-11-29 03:19:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025044306] [2023-11-29 03:19:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025044306] [2023-11-29 03:19:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025044306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:19:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258209421] [2023-11-29 03:19:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:58,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:19:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:19:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:19:58,476 INFO L87 Difference]: Start difference. First operand 33 states and 34 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) [2023-11-29 03:19:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:58,551 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-11-29 03:19:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:19:58,551 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 [2023-11-29 03:19:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:58,552 INFO L225 Difference]: With dead ends: 31 [2023-11-29 03:19:58,552 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 03:19:58,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:19:58,553 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:58,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 03:19:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 03:19:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-11-29 03:19:58,556 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 10 [2023-11-29 03:19:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:58,556 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-11-29 03:19:58,556 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) [2023-11-29 03:19:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-11-29 03:19:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:19:58,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:58,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:58,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:19:58,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:58,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 997674359, now seen corresponding path program 1 times [2023-11-29 03:19:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459509792] [2023-11-29 03:19:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459509792] [2023-11-29 03:19:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459509792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:58,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:58,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:19:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131991175] [2023-11-29 03:19:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:58,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:19:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:19:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:19:58,640 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:58,707 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-29 03:19:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:19:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:19:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:58,708 INFO L225 Difference]: With dead ends: 30 [2023-11-29 03:19:58,708 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 03:19:58,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:19:58,709 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:58,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 03:19:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 03:19:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-11-29 03:19:58,712 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 12 [2023-11-29 03:19:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:58,712 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-11-29 03:19:58,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-11-29 03:19:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:19:58,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:58,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:58,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:19:58,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:58,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:58,713 INFO L85 PathProgramCache]: Analyzing trace with hash 997674360, now seen corresponding path program 1 times [2023-11-29 03:19:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082444224] [2023-11-29 03:19:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082444224] [2023-11-29 03:19:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082444224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:19:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239502037] [2023-11-29 03:19:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:58,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:19:58,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:58,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:19:58,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:19:58,859 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:58,946 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-11-29 03:19:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:19:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:19:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:58,947 INFO L225 Difference]: With dead ends: 29 [2023-11-29 03:19:58,947 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 03:19:58,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:19:58,948 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:58,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 27 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 03:19:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 03:19:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-11-29 03:19:58,951 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 12 [2023-11-29 03:19:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:58,951 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-11-29 03:19:58,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-11-29 03:19:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:19:58,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:58,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:58,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:19:58,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:58,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash 863135680, now seen corresponding path program 1 times [2023-11-29 03:19:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897770086] [2023-11-29 03:19:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897770086] [2023-11-29 03:19:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897770086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:59,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:19:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924370834] [2023-11-29 03:19:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:19:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:19:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:19:59,097 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:59,211 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-29 03:19:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:19:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 03:19:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:59,212 INFO L225 Difference]: With dead ends: 28 [2023-11-29 03:19:59,212 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 03:19:59,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:19:59,213 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:59,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 03:19:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 03:19:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-11-29 03:19:59,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 13 [2023-11-29 03:19:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:59,217 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-29 03:19:59,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-11-29 03:19:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:19:59,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:59,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:59,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:19:59,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:59,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 863135681, now seen corresponding path program 1 times [2023-11-29 03:19:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985831767] [2023-11-29 03:19:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985831767] [2023-11-29 03:19:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985831767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:59,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:59,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:19:59,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367300159] [2023-11-29 03:19:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:59,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:19:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:19:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:19:59,461 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:59,620 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-11-29 03:19:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:19:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 03:19:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:59,621 INFO L225 Difference]: With dead ends: 27 [2023-11-29 03:19:59,622 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:19:59,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:19:59,622 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:59,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 38 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:19:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:19:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-11-29 03:19:59,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 13 [2023-11-29 03:19:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-11-29 03:19:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-11-29 03:19:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:19:59,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:59,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:59,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:19:59,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:59,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1581876990, now seen corresponding path program 1 times [2023-11-29 03:19:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941258859] [2023-11-29 03:19:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941258859] [2023-11-29 03:19:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941258859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:19:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138573610] [2023-11-29 03:19:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:59,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:19:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:19:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:19:59,811 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2023-11-29 03:19:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:59,869 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2023-11-29 03:19:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:19:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 [2023-11-29 03:19:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:59,870 INFO L225 Difference]: With dead ends: 27 [2023-11-29 03:19:59,870 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:19:59,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:19:59,871 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:59,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:19:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:19:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:19:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:19:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2023-11-29 03:19:59,874 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 15 [2023-11-29 03:19:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:59,874 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2023-11-29 03:19:59,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2023-11-29 03:19:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2023-11-29 03:19:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:19:59,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:59,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:59,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:19:59,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:19:59,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1378250370, now seen corresponding path program 1 times [2023-11-29 03:19:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:19:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521939985] [2023-11-29 03:19:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:19:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:19:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:19:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521939985] [2023-11-29 03:19:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521939985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:19:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783397560] [2023-11-29 03:19:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:19:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:19:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:19:59,994 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:00,059 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2023-11-29 03:20:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:20:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:20:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:00,060 INFO L225 Difference]: With dead ends: 27 [2023-11-29 03:20:00,060 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:20:00,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:20:00,061 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:00,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 49 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:20:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:20:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:20:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2023-11-29 03:20:00,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 19 [2023-11-29 03:20:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:00,064 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2023-11-29 03:20:00,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2023-11-29 03:20:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:20:00,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:00,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:00,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:20:00,065 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:20:00,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1378251911, now seen corresponding path program 1 times [2023-11-29 03:20:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115320274] [2023-11-29 03:20:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115320274] [2023-11-29 03:20:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115320274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:20:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172458307] [2023-11-29 03:20:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:00,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:20:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:00,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:20:00,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:20:00,305 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:00,485 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2023-11-29 03:20:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:20:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:20:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:00,486 INFO L225 Difference]: With dead ends: 26 [2023-11-29 03:20:00,486 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 03:20:00,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:20:00,487 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:00,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:20:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 03:20:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 03:20:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2023-11-29 03:20:00,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 19 [2023-11-29 03:20:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:00,490 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2023-11-29 03:20:00,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2023-11-29 03:20:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:20:00,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:00,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:00,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:20:00,491 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:20:00,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1378251912, now seen corresponding path program 1 times [2023-11-29 03:20:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821951187] [2023-11-29 03:20:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821951187] [2023-11-29 03:20:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821951187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:20:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71167962] [2023-11-29 03:20:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:20:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:20:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:20:01,014 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:01,364 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2023-11-29 03:20:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:20:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:20:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:01,365 INFO L225 Difference]: With dead ends: 25 [2023-11-29 03:20:01,365 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:20:01,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:20:01,366 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:01,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:20:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:20:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 03:20:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2023-11-29 03:20:01,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 19 [2023-11-29 03:20:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:01,369 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2023-11-29 03:20:01,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2023-11-29 03:20:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:20:01,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:01,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:01,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 03:20:01,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:20:01,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1650160654, now seen corresponding path program 1 times [2023-11-29 03:20:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237931402] [2023-11-29 03:20:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237931402] [2023-11-29 03:20:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237931402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:01,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:20:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191394399] [2023-11-29 03:20:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:01,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:20:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:20:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:20:01,722 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:01,768 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2023-11-29 03:20:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:20:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 03:20:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:01,769 INFO L225 Difference]: With dead ends: 24 [2023-11-29 03:20:01,769 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 03:20:01,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:20:01,770 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:01,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:20:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 03:20:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 03:20:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2023-11-29 03:20:01,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 21 [2023-11-29 03:20:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:01,772 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2023-11-29 03:20:01,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2023-11-29 03:20:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:20:01,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:01,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:01,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:20:01,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-11-29 03:20:01,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:01,774 INFO L85 PathProgramCache]: Analyzing trace with hash -384629311, now seen corresponding path program 1 times [2023-11-29 03:20:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:01,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807978458] [2023-11-29 03:20:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:20:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807978458] [2023-11-29 03:20:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807978458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 03:20:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128812331] [2023-11-29 03:20:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:20:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:20:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:20:02,290 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:02,642 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2023-11-29 03:20:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:20:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 03:20:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:02,643 INFO L225 Difference]: With dead ends: 20 [2023-11-29 03:20:02,643 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:20:02,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:20:02,644 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:02,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:20:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:20:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:20:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:20:02,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-11-29 03:20:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:20:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:20:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:20:02,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:20:02,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2023-11-29 03:20:02,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2023-11-29 03:20:02,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2023-11-29 03:20:02,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2023-11-29 03:20:02,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2023-11-29 03:20:02,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2023-11-29 03:20:02,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2023-11-29 03:20:02,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2023-11-29 03:20:02,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2023-11-29 03:20:02,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2023-11-29 03:20:02,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2023-11-29 03:20:02,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2023-11-29 03:20:02,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (1 of 32 remaining) [2023-11-29 03:20:02,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2023-11-29 03:20:02,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:20:02,657 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:02,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:20:02,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:20:02 BoogieIcfgContainer [2023-11-29 03:20:02,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:20:02,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:20:02,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:20:02,664 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:20:02,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:19:56" (3/4) ... [2023-11-29 03:20:02,666 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:20:02,674 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2023-11-29 03:20:02,674 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 03:20:02,675 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 03:20:02,675 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:20:02,757 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:20:02,758 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:20:02,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:20:02,759 INFO L158 Benchmark]: Toolchain (without parser) took 7254.60ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 111.0MB in the beginning and 187.5MB in the end (delta: -76.5MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,759 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:20:02,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.19ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 100.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.34ms. Allocated memory is still 146.8MB. Free memory was 100.4MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,761 INFO L158 Benchmark]: Boogie Preprocessor took 47.60ms. Allocated memory is still 146.8MB. Free memory was 98.4MB in the beginning and 96.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,761 INFO L158 Benchmark]: RCFGBuilder took 453.77ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 75.4MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,761 INFO L158 Benchmark]: TraceAbstraction took 6378.37ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 74.8MB in the beginning and 62.4MB in the end (delta: 12.5MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,762 INFO L158 Benchmark]: Witness Printer took 94.83ms. Allocated memory is still 220.2MB. Free memory was 62.4MB in the beginning and 187.5MB in the end (delta: -125.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-11-29 03:20:02,764 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.19ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 100.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.34ms. Allocated memory is still 146.8MB. Free memory was 100.4MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.60ms. Allocated memory is still 146.8MB. Free memory was 98.4MB in the beginning and 96.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.77ms. Allocated memory is still 146.8MB. Free memory was 95.8MB in the beginning and 75.4MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6378.37ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 74.8MB in the beginning and 62.4MB in the end (delta: 12.5MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 94.83ms. Allocated memory is still 220.2MB. Free memory was 62.4MB in the beginning and 187.5MB in the end (delta: -125.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1089 IncrementalHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 273 mSDtfsCounter, 1089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 111, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 03:20:02,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80758a3b-d73e-4d7a-8958-aacd838fb716/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE