./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:44:56,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:44:57,089 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:44:57,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:44:57,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:44:57,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:44:57,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:44:57,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:44:57,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:44:57,134 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:44:57,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:44:57,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:44:57,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:44:57,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:44:57,138 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:44:57,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:44:57,139 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:44:57,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:44:57,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:44:57,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:44:57,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:44:57,143 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:44:57,144 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:44:57,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:44:57,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:44:57,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:44:57,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:44:57,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:44:57,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:44:57,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:44:57,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:44:57,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:44:57,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:44:57,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:44:57,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:44:57,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:44:57,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:44:57,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:44:57,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:44:57,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:44:57,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:44:57,155 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_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/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_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-26 10:44:57,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:44:57,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:44:57,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:44:57,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:44:57,563 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:44:57,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-26 10:45:01,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:45:01,677 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:45:01,678 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-26 10:45:01,707 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/data/d973d9285/268ad5c458d742edb3f5ee652b61556b/FLAG7bd538cc6 [2023-11-26 10:45:01,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/data/d973d9285/268ad5c458d742edb3f5ee652b61556b [2023-11-26 10:45:01,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:45:01,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:45:01,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:01,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:45:01,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:45:01,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:01" (1/1) ... [2023-11-26 10:45:01,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52792268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:01, skipping insertion in model container [2023-11-26 10:45:01,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:01" (1/1) ... [2023-11-26 10:45:01,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:45:02,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:02,269 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:45:02,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:02,372 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:45:02,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02 WrapperNode [2023-11-26 10:45:02,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:02,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:02,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:45:02,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:45:02,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,477 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-26 10:45:02,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:02,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:45:02,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:45:02,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:45:02,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,540 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-26 10:45:02,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:45:02,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:45:02,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:45:02,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:45:02,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (1/1) ... [2023-11-26 10:45:02,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:02,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:02,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:45:02,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-26 10:45:02,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-26 10:45:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:45:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:45:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:45:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 10:45:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 10:45:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:45:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:45:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:45:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:45:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:45:02,810 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:45:02,813 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:45:03,499 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:45:03,584 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:45:03,585 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-26 10:45:03,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:03 BoogieIcfgContainer [2023-11-26 10:45:03,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:45:03,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:45:03,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:45:03,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:45:03,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:45:01" (1/3) ... [2023-11-26 10:45:03,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a3923a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:03, skipping insertion in model container [2023-11-26 10:45:03,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:02" (2/3) ... [2023-11-26 10:45:03,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a3923a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:03, skipping insertion in model container [2023-11-26 10:45:03,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:03" (3/3) ... [2023-11-26 10:45:03,605 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-26 10:45:03,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:45:03,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-26 10:45:03,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:45:03,716 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;@6709daf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:45:03,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-26 10:45:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:45:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-26 10:45:03,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:03,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-26 10:45:03,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:03,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash 9685, now seen corresponding path program 1 times [2023-11-26 10:45:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864553947] [2023-11-26 10:45:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:04,042 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-26 10:45:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864553947] [2023-11-26 10:45:04,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864553947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:04,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:45:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761713794] [2023-11-26 10:45:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:04,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:04,124 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-26 10:45:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:04,411 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-26 10:45:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:04,414 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-26 10:45:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:04,430 INFO L225 Difference]: With dead ends: 136 [2023-11-26 10:45:04,430 INFO L226 Difference]: Without dead ends: 135 [2023-11-26 10:45:04,433 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-26 10:45:04,439 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:04,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-26 10:45:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-26 10:45:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-26 10:45:04,522 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-26 10:45:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:04,522 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-26 10:45:04,523 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-26 10:45:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-26 10:45:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-26 10:45:04,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:04,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-26 10:45:04,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:45:04,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:04,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 9686, now seen corresponding path program 1 times [2023-11-26 10:45:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641535699] [2023-11-26 10:45:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:04,674 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-26 10:45:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641535699] [2023-11-26 10:45:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641535699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:45:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6710833] [2023-11-26 10:45:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:04,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:04,680 INFO L87 Difference]: Start difference. First operand 116 states and 123 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-26 10:45:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:04,865 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2023-11-26 10:45:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:04,866 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-26 10:45:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:04,868 INFO L225 Difference]: With dead ends: 140 [2023-11-26 10:45:04,868 INFO L226 Difference]: Without dead ends: 140 [2023-11-26 10:45:04,869 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-26 10:45:04,871 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:04,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-26 10:45:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2023-11-26 10:45:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-26 10:45:04,885 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-26 10:45:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:04,885 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-26 10:45:04,885 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-26 10:45:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-26 10:45:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-26 10:45:04,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:04,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:04,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:45:04,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:04,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866331, now seen corresponding path program 1 times [2023-11-26 10:45:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550993825] [2023-11-26 10:45:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:05,009 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-26 10:45:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550993825] [2023-11-26 10:45:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550993825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:05,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:45:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459210243] [2023-11-26 10:45:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:05,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:05,014 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:05,283 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-26 10:45:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-26 10:45:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:05,286 INFO L225 Difference]: With dead ends: 116 [2023-11-26 10:45:05,286 INFO L226 Difference]: Without dead ends: 116 [2023-11-26 10:45:05,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:05,288 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:05,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-26 10:45:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-26 10:45:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-26 10:45:05,299 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-26 10:45:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:05,299 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-26 10:45:05,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-26 10:45:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-26 10:45:05,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:05,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:05,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:45:05,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:05,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866330, now seen corresponding path program 1 times [2023-11-26 10:45:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624134661] [2023-11-26 10:45:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:05,511 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-26 10:45:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624134661] [2023-11-26 10:45:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624134661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596380918] [2023-11-26 10:45:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:05,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:05,514 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:05,822 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2023-11-26 10:45:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:45:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-26 10:45:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:05,828 INFO L225 Difference]: With dead ends: 178 [2023-11-26 10:45:05,828 INFO L226 Difference]: Without dead ends: 178 [2023-11-26 10:45:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:05,833 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 185 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:05,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 97 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:45:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-26 10:45:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2023-11-26 10:45:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 129 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-11-26 10:45:05,851 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 7 [2023-11-26 10:45:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:05,851 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-11-26 10:45:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-11-26 10:45:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 10:45:05,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:05,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:45:05,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:05,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222096, now seen corresponding path program 1 times [2023-11-26 10:45:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962903352] [2023-11-26 10:45:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:06,039 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-26 10:45:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962903352] [2023-11-26 10:45:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962903352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973454905] [2023-11-26 10:45:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:06,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:06,043 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:06,277 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-11-26 10:45:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-26 10:45:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:06,280 INFO L225 Difference]: With dead ends: 130 [2023-11-26 10:45:06,280 INFO L226 Difference]: Without dead ends: 130 [2023-11-26 10:45:06,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:06,283 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:06,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-26 10:45:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-26 10:45:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 128 states have internal predecessors, (143), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2023-11-26 10:45:06,296 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 9 [2023-11-26 10:45:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:06,297 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2023-11-26 10:45:06,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2023-11-26 10:45:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 10:45:06,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:06,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:45:06,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:06,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222095, now seen corresponding path program 1 times [2023-11-26 10:45:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762378798] [2023-11-26 10:45:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:06,724 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-26 10:45:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762378798] [2023-11-26 10:45:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762378798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921765768] [2023-11-26 10:45:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:06,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:06,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:06,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:06,733 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:06,989 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-26 10:45:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-26 10:45:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:06,999 INFO L225 Difference]: With dead ends: 129 [2023-11-26 10:45:06,999 INFO L226 Difference]: Without dead ends: 129 [2023-11-26 10:45:07,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:07,001 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:07,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-26 10:45:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-26 10:45:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 127 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-26 10:45:07,029 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 9 [2023-11-26 10:45:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:07,030 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-26 10:45:07,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-26 10:45:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 10:45:07,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:07,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:45:07,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:07,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224648, now seen corresponding path program 1 times [2023-11-26 10:45:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860995564] [2023-11-26 10:45:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:07,188 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-26 10:45:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860995564] [2023-11-26 10:45:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860995564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:07,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:07,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528947844] [2023-11-26 10:45:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:07,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:07,192 INFO L87 Difference]: Start difference. First operand 129 states and 147 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-26 10:45:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:07,390 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-11-26 10:45:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:07,391 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-26 10:45:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:07,392 INFO L225 Difference]: With dead ends: 128 [2023-11-26 10:45:07,392 INFO L226 Difference]: Without dead ends: 128 [2023-11-26 10:45:07,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:07,394 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:07,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-26 10:45:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-26 10:45:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-26 10:45:07,400 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 10 [2023-11-26 10:45:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:07,401 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-26 10:45:07,401 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-26 10:45:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-26 10:45:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 10:45:07,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:07,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:07,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:45:07,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:07,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224649, now seen corresponding path program 1 times [2023-11-26 10:45:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430752505] [2023-11-26 10:45:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:07,724 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-26 10:45:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430752505] [2023-11-26 10:45:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430752505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952130484] [2023-11-26 10:45:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:07,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:07,729 INFO L87 Difference]: Start difference. First operand 128 states and 145 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-26 10:45:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:07,932 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-26 10:45:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:07,933 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-26 10:45:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:07,934 INFO L225 Difference]: With dead ends: 127 [2023-11-26 10:45:07,934 INFO L226 Difference]: Without dead ends: 127 [2023-11-26 10:45:07,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:07,935 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:07,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-26 10:45:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-26 10:45:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 125 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2023-11-26 10:45:07,941 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 10 [2023-11-26 10:45:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:07,942 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2023-11-26 10:45:07,942 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-26 10:45:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2023-11-26 10:45:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 10:45:07,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:07,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:45:07,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:07,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 327030838, now seen corresponding path program 1 times [2023-11-26 10:45:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141473273] [2023-11-26 10:45:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:08,321 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-26 10:45:08,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141473273] [2023-11-26 10:45:08,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141473273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:08,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:08,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:45:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634509742] [2023-11-26 10:45:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:45:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:45:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:45:08,325 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:08,711 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2023-11-26 10:45:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:45:08,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-26 10:45:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:08,713 INFO L225 Difference]: With dead ends: 130 [2023-11-26 10:45:08,714 INFO L226 Difference]: Without dead ends: 130 [2023-11-26 10:45:08,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:45:08,715 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:08,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 152 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:45:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-26 10:45:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2023-11-26 10:45:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 124 states have internal predecessors, (136), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2023-11-26 10:45:08,721 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 11 [2023-11-26 10:45:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:08,721 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2023-11-26 10:45:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2023-11-26 10:45:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 10:45:08,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:08,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:08,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:45:08,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:08,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash 327030839, now seen corresponding path program 1 times [2023-11-26 10:45:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586687781] [2023-11-26 10:45:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:09,192 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-26 10:45:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586687781] [2023-11-26 10:45:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586687781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:45:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749883405] [2023-11-26 10:45:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:09,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:45:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:45:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:09,195 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:09,830 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-26 10:45:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:45:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-26 10:45:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:09,833 INFO L225 Difference]: With dead ends: 125 [2023-11-26 10:45:09,833 INFO L226 Difference]: Without dead ends: 125 [2023-11-26 10:45:09,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:45:09,834 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:09,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:45:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-26 10:45:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-11-26 10:45:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 105 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2023-11-26 10:45:09,840 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 11 [2023-11-26 10:45:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:09,840 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2023-11-26 10:45:09,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2023-11-26 10:45:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 10:45:09,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:09,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:09,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:45:09,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:09,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 164325843, now seen corresponding path program 1 times [2023-11-26 10:45:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848777630] [2023-11-26 10:45:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:10,116 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-26 10:45:10,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848777630] [2023-11-26 10:45:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848777630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:45:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522068586] [2023-11-26 10:45:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:10,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:45:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:45:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:45:10,120 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:10,353 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-11-26 10:45:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-26 10:45:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:10,355 INFO L225 Difference]: With dead ends: 106 [2023-11-26 10:45:10,355 INFO L226 Difference]: Without dead ends: 106 [2023-11-26 10:45:10,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:10,356 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:10,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-26 10:45:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-26 10:45:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.513157894736842) internal successors, (115), 104 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-11-26 10:45:10,361 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 12 [2023-11-26 10:45:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:10,362 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-11-26 10:45:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-11-26 10:45:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 10:45:10,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:10,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:45:10,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:10,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 164325844, now seen corresponding path program 1 times [2023-11-26 10:45:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109672927] [2023-11-26 10:45:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:10,731 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-26 10:45:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109672927] [2023-11-26 10:45:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109672927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:45:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721118131] [2023-11-26 10:45:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:10,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:45:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:45:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:45:10,735 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:11,019 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2023-11-26 10:45:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:11,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-26 10:45:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:11,021 INFO L225 Difference]: With dead ends: 105 [2023-11-26 10:45:11,021 INFO L226 Difference]: Without dead ends: 105 [2023-11-26 10:45:11,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:11,022 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:11,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-26 10:45:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-26 10:45:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.5) internal successors, (114), 103 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2023-11-26 10:45:11,031 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2023-11-26 10:45:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:11,031 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2023-11-26 10:45:11,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2023-11-26 10:45:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-26 10:45:11,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:11,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:11,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:45:11,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:11,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2042218147, now seen corresponding path program 1 times [2023-11-26 10:45:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397848225] [2023-11-26 10:45:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:11,373 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-26 10:45:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397848225] [2023-11-26 10:45:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397848225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:11,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:45:11,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444355225] [2023-11-26 10:45:11,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:11,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:45:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:45:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:11,378 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:12,006 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-26 10:45:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 10:45:12,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-26 10:45:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:12,010 INFO L225 Difference]: With dead ends: 120 [2023-11-26 10:45:12,011 INFO L226 Difference]: Without dead ends: 120 [2023-11-26 10:45:12,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:45:12,012 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:12,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 242 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:45:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-26 10:45:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-11-26 10:45:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.486842105263158) internal successors, (113), 102 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-26 10:45:12,019 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2023-11-26 10:45:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:12,020 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-26 10:45:12,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-26 10:45:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-26 10:45:12,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:12,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:12,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:45:12,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:12,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 174750842, now seen corresponding path program 1 times [2023-11-26 10:45:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470819727] [2023-11-26 10:45:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:12,126 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-26 10:45:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470819727] [2023-11-26 10:45:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470819727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:45:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106204806] [2023-11-26 10:45:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:12,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:12,130 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:12,292 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-26 10:45:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-26 10:45:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:12,295 INFO L225 Difference]: With dead ends: 154 [2023-11-26 10:45:12,296 INFO L226 Difference]: Without dead ends: 154 [2023-11-26 10:45:12,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:12,297 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:12,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:45:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-26 10:45:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2023-11-26 10:45:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 101 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2023-11-26 10:45:12,310 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 16 [2023-11-26 10:45:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:12,315 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2023-11-26 10:45:12,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2023-11-26 10:45:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:45:12,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:12,317 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-26 10:45:12,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:45:12,318 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:12,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -622081400, now seen corresponding path program 1 times [2023-11-26 10:45:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248043646] [2023-11-26 10:45:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:12,420 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-26 10:45:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248043646] [2023-11-26 10:45:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248043646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442478140] [2023-11-26 10:45:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:12,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:12,423 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:12,595 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-26 10:45:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:12,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-26 10:45:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:12,597 INFO L225 Difference]: With dead ends: 102 [2023-11-26 10:45:12,598 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 10:45:12,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:12,599 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:12,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 195 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 10:45:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-26 10:45:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-26 10:45:12,606 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 21 [2023-11-26 10:45:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:12,607 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-26 10:45:12,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-26 10:45:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:45:12,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:12,612 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-26 10:45:12,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:45:12,613 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:12,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -590564444, now seen corresponding path program 1 times [2023-11-26 10:45:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892564916] [2023-11-26 10:45:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:13,734 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-26 10:45:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892564916] [2023-11-26 10:45:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892564916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 10:45:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464903251] [2023-11-26 10:45:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:13,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 10:45:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 10:45:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:45:13,737 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:14,323 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2023-11-26 10:45:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:45:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-26 10:45:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:14,325 INFO L225 Difference]: With dead ends: 133 [2023-11-26 10:45:14,325 INFO L226 Difference]: Without dead ends: 133 [2023-11-26 10:45:14,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:45:14,327 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:14,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:45:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-26 10:45:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2023-11-26 10:45:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 112 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-11-26 10:45:14,336 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 21 [2023-11-26 10:45:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:14,337 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-11-26 10:45:14,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-11-26 10:45:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:45:14,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:14,338 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-26 10:45:14,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:45:14,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:14,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -622050630, now seen corresponding path program 1 times [2023-11-26 10:45:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284822327] [2023-11-26 10:45:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:14,781 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-26 10:45:14,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:14,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284822327] [2023-11-26 10:45:14,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284822327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:14,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:14,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:45:14,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492576011] [2023-11-26 10:45:14,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:14,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:45:14,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:14,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:45:14,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:14,784 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:15,119 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2023-11-26 10:45:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:45:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:15,121 INFO L225 Difference]: With dead ends: 135 [2023-11-26 10:45:15,121 INFO L226 Difference]: Without dead ends: 135 [2023-11-26 10:45:15,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:45:15,122 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 134 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:15,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 161 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-26 10:45:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2023-11-26 10:45:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-11-26 10:45:15,126 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 21 [2023-11-26 10:45:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:15,127 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-11-26 10:45:15,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-11-26 10:45:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:45:15,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:15,128 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-26 10:45:15,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:45:15,128 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:15,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -622050629, now seen corresponding path program 1 times [2023-11-26 10:45:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438026807] [2023-11-26 10:45:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:15,702 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-26 10:45:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438026807] [2023-11-26 10:45:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438026807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:45:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575125994] [2023-11-26 10:45:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:15,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:45:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:45:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:15,705 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:16,081 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-11-26 10:45:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:45:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:16,083 INFO L225 Difference]: With dead ends: 138 [2023-11-26 10:45:16,083 INFO L226 Difference]: Without dead ends: 138 [2023-11-26 10:45:16,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:45:16,084 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 48 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:16,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 240 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:45:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-26 10:45:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2023-11-26 10:45:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-26 10:45:16,092 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 21 [2023-11-26 10:45:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:16,093 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-26 10:45:16,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-26 10:45:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-26 10:45:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:45:16,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:16,095 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, 1, 1, 1] [2023-11-26 10:45:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:45:16,096 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:16,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 830531664, now seen corresponding path program 1 times [2023-11-26 10:45:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680852273] [2023-11-26 10:45:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:17,006 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-26 10:45:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680852273] [2023-11-26 10:45:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680852273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:17,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:45:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119323088] [2023-11-26 10:45:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:17,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:45:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:45:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:45:17,010 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:17,459 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-11-26 10:45:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:45:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-26 10:45:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:17,461 INFO L225 Difference]: With dead ends: 137 [2023-11-26 10:45:17,461 INFO L226 Difference]: Without dead ends: 137 [2023-11-26 10:45:17,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:45:17,462 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 167 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:17,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 294 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:45:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-26 10:45:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2023-11-26 10:45:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-26 10:45:17,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-11-26 10:45:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:17,469 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-26 10:45:17,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-26 10:45:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 10:45:17,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:17,474 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:45:17,475 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:17,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 228498532, now seen corresponding path program 1 times [2023-11-26 10:45:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505690657] [2023-11-26 10:45:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:17,601 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-26 10:45:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505690657] [2023-11-26 10:45:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505690657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397001807] [2023-11-26 10:45:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:17,606 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-26 10:45:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:17,762 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-26 10:45:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:45:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) Word has length 29 [2023-11-26 10:45:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:17,766 INFO L225 Difference]: With dead ends: 131 [2023-11-26 10:45:17,766 INFO L226 Difference]: Without dead ends: 131 [2023-11-26 10:45:17,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:17,767 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:17,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:45:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-26 10:45:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-26 10:45:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-11-26 10:45:17,773 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2023-11-26 10:45:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-11-26 10:45:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-26 10:45:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-11-26 10:45:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-26 10:45:17,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:17,775 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:45:17,776 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 10:45:17,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1022216661, now seen corresponding path program 1 times [2023-11-26 10:45:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697097559] [2023-11-26 10:45:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:45:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697097559] [2023-11-26 10:45:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697097559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444753172] [2023-11-26 10:45:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:19,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:19,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_573e9b04-b728-4ac3-8da0-4af5a8757ea1/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:45:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-26 10:45:19,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 10:45:19,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 10:45:19,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 10:45:19,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 10:45:19,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:45:19,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-26 10:45:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 10:45:19,593 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 10:45:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-26 10:45:19,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-26 10:45:19,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-26 10:45:19,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 10:45:19,761 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-26 10:45:19,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-26 10:45:19,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 10:45:19,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 10:45:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 10:45:19,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 10:45:19,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-26 10:45:19,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-26 10:45:20,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-26 10:45:20,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 10:45:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:45:20,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:20,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_825) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-26 10:45:20,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:45:20,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-11-26 10:45:20,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-26 10:45:20,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-26 10:45:21,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:45:21,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 137 [2023-11-26 10:45:21,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 233 [2023-11-26 10:45:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 213 [2023-11-26 10:45:22,114 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-26 10:45:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2023-11-26 10:45:22,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218