./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test19.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 7803e6cc268064256b2f537d6548202260755eda12a32948c0dafd94d7d212db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:54:14,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:54:14,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:54:14,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:54:14,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:54:14,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:54:14,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:54:14,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:54:14,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:54:14,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:54:14,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:54:14,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:54:14,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:54:14,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:54:14,870 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:54:14,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:54:14,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:54:14,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:54:14,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:54:14,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:54:14,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:54:14,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:54:14,873 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:54:14,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:54:14,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:54:14,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:54:14,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:54:14,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:54:14,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:54:14,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:54:14,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:54:14,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:54:14,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:54:14,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:54:14,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:54:14,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:54:14,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:54:14,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:54:14,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:54:14,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:54:14,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:54:14,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:54:14,880 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> 7803e6cc268064256b2f537d6548202260755eda12a32948c0dafd94d7d212db [2024-10-11 17:54:15,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:54:15,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:54:15,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:54:15,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:54:15,168 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:54:15,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test19.c [2024-10-11 17:54:16,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:54:16,767 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:54:16,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test19.c [2024-10-11 17:54:16,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19c058832/cabf8b1cdedf4c0c8a9eef4a8a63619d/FLAG7512729ed [2024-10-11 17:54:16,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19c058832/cabf8b1cdedf4c0c8a9eef4a8a63619d [2024-10-11 17:54:16,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:54:16,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:54:16,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:54:16,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:54:16,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:54:16,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:54:16" (1/1) ... [2024-10-11 17:54:16,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d87616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:16, skipping insertion in model container [2024-10-11 17:54:16,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:54:16" (1/1) ... [2024-10-11 17:54:16,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:54:16,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:54:17,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:54:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:54:17,046 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:54:17,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17 WrapperNode [2024-10-11 17:54:17,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:54:17,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:54:17,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:54:17,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:54:17,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,090 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-10-11 17:54:17,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:54:17,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:54:17,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:54:17,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:54:17,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,123 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 3, 2, 2, 3]. 25 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-10-11 17:54:17,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:54:17,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:54:17,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:54:17,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:54:17,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (1/1) ... [2024-10-11 17:54:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:54:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:54:17,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:54:17,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 17:54:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:54:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:54:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:54:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 17:54:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 17:54:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:54:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:54:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:54:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:54:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:54:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:54:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 17:54:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 17:54:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 17:54:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:54:17,396 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:54:17,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:54:17,596 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-11 17:54:17,596 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:54:17,645 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:54:17,645 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:54:17,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:17 BoogieIcfgContainer [2024-10-11 17:54:17,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:54:17,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:54:17,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:54:17,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:54:17,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:54:16" (1/3) ... [2024-10-11 17:54:17,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aea5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:54:17, skipping insertion in model container [2024-10-11 17:54:17,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:17" (2/3) ... [2024-10-11 17:54:17,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aea5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:54:17, skipping insertion in model container [2024-10-11 17:54:17,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:17" (3/3) ... [2024-10-11 17:54:17,659 INFO L112 eAbstractionObserver]: Analyzing ICFG test19.c [2024-10-11 17:54:17,674 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:54:17,675 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 17:54:17,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:54:17,715 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a9fb3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:54:17,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-11 17:54:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 10 states have (on average 2.5) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:54:17,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:17,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:54:17,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2329, now seen corresponding path program 1 times [2024-10-11 17:54:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898848830] [2024-10-11 17:54:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898848830] [2024-10-11 17:54:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898848830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:18,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220818769] [2024-10-11 17:54:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:18,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:18,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:18,116 INFO L87 Difference]: Start difference. First operand has 25 states, 10 states have (on average 2.5) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2024-10-11 17:54:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:18,169 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-10-11 17:54:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:18,171 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 [2024-10-11 17:54:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:18,177 INFO L225 Difference]: With dead ends: 24 [2024-10-11 17:54:18,177 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:54:18,178 INFO L431 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 [2024-10-11 17:54:18,182 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:18,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:54:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:54:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 2.2) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-10-11 17:54:18,208 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 2 [2024-10-11 17:54:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:18,209 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-10-11 17:54:18,209 INFO L472 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) [2024-10-11 17:54:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-10-11 17:54:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:54:18,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:18,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:54:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:54:18,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2330, now seen corresponding path program 1 times [2024-10-11 17:54:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77953207] [2024-10-11 17:54:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77953207] [2024-10-11 17:54:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77953207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922701564] [2024-10-11 17:54:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:18,424 INFO L87 Difference]: Start difference. First operand 23 states and 22 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) [2024-10-11 17:54:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:18,462 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-10-11 17:54:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:18,462 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 [2024-10-11 17:54:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:18,463 INFO L225 Difference]: With dead ends: 22 [2024-10-11 17:54:18,463 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 17:54:18,465 INFO L431 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 [2024-10-11 17:54:18,466 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:18,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 17:54:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 17:54:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 10 states have (on average 2.1) internal successors, (21), 21 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) [2024-10-11 17:54:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-10-11 17:54:18,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 2 [2024-10-11 17:54:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:18,474 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-10-11 17:54:18,475 INFO L472 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) [2024-10-11 17:54:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-10-11 17:54:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:54:18,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:18,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:54:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:54:18,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 73571, now seen corresponding path program 1 times [2024-10-11 17:54:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:18,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137710759] [2024-10-11 17:54:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137710759] [2024-10-11 17:54:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137710759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733027087] [2024-10-11 17:54:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:18,564 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:18,604 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-10-11 17:54:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:54:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:18,605 INFO L225 Difference]: With dead ends: 21 [2024-10-11 17:54:18,606 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 17:54:18,606 INFO L431 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 [2024-10-11 17:54:18,607 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:18,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 17:54:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 17:54:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 2.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-10-11 17:54:18,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 3 [2024-10-11 17:54:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:18,612 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-10-11 17:54:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-10-11 17:54:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:54:18,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:18,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:54:18,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:54:18,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:18,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 73572, now seen corresponding path program 1 times [2024-10-11 17:54:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844452599] [2024-10-11 17:54:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844452599] [2024-10-11 17:54:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844452599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186502013] [2024-10-11 17:54:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:18,714 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:18,792 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-10-11 17:54:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:54:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:18,794 INFO L225 Difference]: With dead ends: 20 [2024-10-11 17:54:18,794 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 17:54:18,794 INFO L431 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 [2024-10-11 17:54:18,795 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:18,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:54:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 17:54:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 17:54:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.9) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2024-10-11 17:54:18,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 3 [2024-10-11 17:54:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:18,805 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2024-10-11 17:54:18,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-10-11 17:54:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:54:18,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:18,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:54:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:54:18,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2281736, now seen corresponding path program 1 times [2024-10-11 17:54:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055792129] [2024-10-11 17:54:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055792129] [2024-10-11 17:54:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055792129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:18,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978521955] [2024-10-11 17:54:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:18,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:18,992 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,040 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-10-11 17:54:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:54:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:54:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,041 INFO L225 Difference]: With dead ends: 19 [2024-10-11 17:54:19,041 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 17:54:19,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:19,042 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 17:54:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 17:54:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 10 states have (on average 1.8) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-10-11 17:54:19,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 4 [2024-10-11 17:54:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,048 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-10-11 17:54:19,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-10-11 17:54:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:54:19,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:54:19,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:54:19,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2281737, now seen corresponding path program 1 times [2024-10-11 17:54:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382133548] [2024-10-11 17:54:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382133548] [2024-10-11 17:54:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382133548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:54:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403326009] [2024-10-11 17:54:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:54:19,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:54:19,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:19,209 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,242 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2024-10-11 17:54:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:54:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:54:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,243 INFO L225 Difference]: With dead ends: 18 [2024-10-11 17:54:19,243 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 17:54:19,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:19,244 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 17:54:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-11 17:54:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.7) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2024-10-11 17:54:19,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 4 [2024-10-11 17:54:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,250 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2024-10-11 17:54:19,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2024-10-11 17:54:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:54:19,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:54:19,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:54:19,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash 70733801, now seen corresponding path program 1 times [2024-10-11 17:54:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356049145] [2024-10-11 17:54:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356049145] [2024-10-11 17:54:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356049145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:54:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311154740] [2024-10-11 17:54:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:54:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:54:19,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:19,571 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,604 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2024-10-11 17:54:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:54:19,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:54:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,605 INFO L225 Difference]: With dead ends: 17 [2024-10-11 17:54:19,605 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 17:54:19,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:19,607 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 17:54:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 17:54:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-10-11 17:54:19,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 5 [2024-10-11 17:54:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-10-11 17:54:19,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-10-11 17:54:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:54:19,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:54:19,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:54:19,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 70733800, now seen corresponding path program 1 times [2024-10-11 17:54:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913879025] [2024-10-11 17:54:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913879025] [2024-10-11 17:54:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913879025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:54:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672114493] [2024-10-11 17:54:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:54:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:54:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:54:19,780 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,817 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-10-11 17:54:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:54:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:54:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,819 INFO L225 Difference]: With dead ends: 16 [2024-10-11 17:54:19,819 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 17:54:19,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:54:19,820 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 17:54:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 17:54:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-10-11 17:54:19,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 5 [2024-10-11 17:54:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,824 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-10-11 17:54:19,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-10-11 17:54:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:54:19,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:54:19,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:54:19,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2102218483, now seen corresponding path program 1 times [2024-10-11 17:54:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029129516] [2024-10-11 17:54:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029129516] [2024-10-11 17:54:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029129516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890501597] [2024-10-11 17:54:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:19,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:19,906 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,955 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2024-10-11 17:54:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:54:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:54:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,956 INFO L225 Difference]: With dead ends: 15 [2024-10-11 17:54:19,956 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 17:54:19,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:54:19,957 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 17:54:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 17:54:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2024-10-11 17:54:19,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 6 [2024-10-11 17:54:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,959 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2024-10-11 17:54:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2024-10-11 17:54:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:54:19,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:54:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:54:19,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2102218482, now seen corresponding path program 1 times [2024-10-11 17:54:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854075839] [2024-10-11 17:54:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854075839] [2024-10-11 17:54:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854075839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222871989] [2024-10-11 17:54:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:20,104 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,150 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-10-11 17:54:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:54:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:54:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,150 INFO L225 Difference]: With dead ends: 14 [2024-10-11 17:54:20,150 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 17:54:20,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:54:20,151 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 17:54:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 17:54:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-10-11 17:54:20,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 6 [2024-10-11 17:54:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,154 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-10-11 17:54:20,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-10-11 17:54:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:54:20,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:20,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:54:20,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash -744263540, now seen corresponding path program 1 times [2024-10-11 17:54:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706398402] [2024-10-11 17:54:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706398402] [2024-10-11 17:54:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706398402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683175826] [2024-10-11 17:54:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:20,214 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,249 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-10-11 17:54:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:54:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:54:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,250 INFO L225 Difference]: With dead ends: 13 [2024-10-11 17:54:20,251 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 17:54:20,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:54:20,251 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 17:54:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 17:54:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2024-10-11 17:54:20,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 7 [2024-10-11 17:54:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,254 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2024-10-11 17:54:20,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2024-10-11 17:54:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:54:20,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:20,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:20,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:54:20,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -744263539, now seen corresponding path program 1 times [2024-10-11 17:54:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042584222] [2024-10-11 17:54:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:20,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042584222] [2024-10-11 17:54:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042584222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:20,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596014169] [2024-10-11 17:54:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:20,350 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,392 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-10-11 17:54:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:54:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:54:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,393 INFO L225 Difference]: With dead ends: 12 [2024-10-11 17:54:20,393 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 17:54:20,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:54:20,394 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 17:54:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 17:54:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) [2024-10-11 17:54:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2024-10-11 17:54:20,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 7 [2024-10-11 17:54:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,395 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2024-10-11 17:54:20,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2024-10-11 17:54:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:54:20,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:20,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:20,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:54:20,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:20,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2022276499, now seen corresponding path program 1 times [2024-10-11 17:54:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150964014] [2024-10-11 17:54:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:20,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150964014] [2024-10-11 17:54:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150964014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:54:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965997140] [2024-10-11 17:54:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:54:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:54:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:20,650 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,672 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2024-10-11 17:54:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:54:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:54:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,673 INFO L225 Difference]: With dead ends: 11 [2024-10-11 17:54:20,674 INFO L226 Difference]: Without dead ends: 10 [2024-10-11 17:54:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:20,675 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-11 17:54:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-11 17:54:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9 transitions. [2024-10-11 17:54:20,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 9 transitions. Word has length 9 [2024-10-11 17:54:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 9 transitions. [2024-10-11 17:54:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2024-10-11 17:54:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:54:20,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:20,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:54:20,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2022276990, now seen corresponding path program 1 times [2024-10-11 17:54:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460542908] [2024-10-11 17:54:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:54:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460542908] [2024-10-11 17:54:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460542908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:20,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:54:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386837700] [2024-10-11 17:54:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:54:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:54:20,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:54:20,904 INFO L87 Difference]: Start difference. First operand 10 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,942 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2024-10-11 17:54:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:54:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:54:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,943 INFO L225 Difference]: With dead ends: 8 [2024-10-11 17:54:20,943 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:54:20,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:54:20,944 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:54:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:54:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:54:20,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2024-10-11 17:54:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,946 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:54:20,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.0) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:54:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:54:20,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:54:20,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-10-11 17:54:20,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-10-11 17:54:20,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-10-11 17:54:20,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-10-11 17:54:20,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-10-11 17:54:20,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-10-11 17:54:20,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2024-10-11 17:54:20,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-10-11 17:54:20,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:54:20,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:20,959 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:54:20,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:54:20 BoogieIcfgContainer [2024-10-11 17:54:20,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:54:20,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:54:20,965 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:54:20,965 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:54:20,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:17" (3/4) ... [2024-10-11 17:54:20,968 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:54:20,976 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 17:54:20,976 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 17:54:20,976 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:54:20,977 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:54:21,071 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:54:21,072 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:54:21,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:54:21,072 INFO L158 Benchmark]: Toolchain (without parser) took 4281.55ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 111.5MB in the beginning and 58.0MB in the end (delta: 53.5MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,073 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:54:21,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.74ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 99.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.25ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 97.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:54:21,073 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,074 INFO L158 Benchmark]: RCFGBuilder took 502.98ms. Allocated memory is still 163.6MB. Free memory was 95.3MB in the beginning and 120.9MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,074 INFO L158 Benchmark]: TraceAbstraction took 3313.33ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 120.9MB in the beginning and 62.2MB in the end (delta: 58.7MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,074 INFO L158 Benchmark]: Witness Printer took 106.87ms. Allocated memory is still 197.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:54:21,076 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.74ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 99.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.25ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 97.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 502.98ms. Allocated memory is still 163.6MB. Free memory was 95.3MB in the beginning and 120.9MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3313.33ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 120.9MB in the beginning and 62.2MB in the end (delta: 58.7MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. * Witness Printer took 106.87ms. Allocated memory is still 197.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 13]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 115 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:54:21,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE