./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/nested_structure-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/ldv-regression/nested_structure-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'ea326fa3b3c9fd831a506f8385a58b98f853e8c897ae4643e624e28b471a415c']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/nested_structure-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ea326fa3b3c9fd831a506f8385a58b98f853e8c897ae4643e624e28b471a415c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:23:26,688 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:23:26,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-07 16:23:26,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:23:26,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:23:26,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:23:26,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:23:26,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:23:26,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:23:26,800 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:23:26,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:23:26,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:23:26,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:23:26,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:23:26,801 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:23:26,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:23:26,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:23:26,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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-jdk21/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 -> ea326fa3b3c9fd831a506f8385a58b98f853e8c897ae4643e624e28b471a415c
[2024-11-07 16:23:27,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:23:27,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:23:27,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:23:27,030 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:23:27,030 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:23:27,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/nested_structure-2.i
[2024-11-07 16:23:28,176 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:23:28,334 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:23:28,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/nested_structure-2.i
[2024-11-07 16:23:28,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88d199fa6/b7fad9d9d5124994be62d27b238754df/FLAGa32ddc400
[2024-11-07 16:23:28,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88d199fa6/b7fad9d9d5124994be62d27b238754df
[2024-11-07 16:23:28,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:23:28,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:23:28,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:23:28,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:23:28,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:23:28,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e1867f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28, skipping insertion in model container
[2024-11-07 16:23:28,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,754 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:23:28,845 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:23:28,854 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:23:28,865 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:23:28,875 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:23:28,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28 WrapperNode
[2024-11-07 16:23:28,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:23:28,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:23:28,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:23:28,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:23:28,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,895 INFO L138 Inliner]: procedures = 18, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50
[2024-11-07 16:23:28,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:23:28,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:23:28,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:23:28,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:23:28,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,911 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 4, 4, 3]. 31 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 2, 2, 1]. The 1 writes are split as follows [0, 0, 0, 1].
[2024-11-07 16:23:28,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:23:28,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:23:28,926 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:23:28,926 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:23:28,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (1/1) ...
[2024-11-07 16:23:28,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:23:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:23:28,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 16:23:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 16:23:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-07 16:23:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-07 16:23:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-07 16:23:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:23:28,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3
[2024-11-07 16:23:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:23:29,055 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:23:29,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:23:29,194 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live.
[2024-11-07 16:23:29,194 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:23:29,201 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:23:29,202 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 16:23:29,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:29 BoogieIcfgContainer
[2024-11-07 16:23:29,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:23:29,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:23:29,205 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:23:29,209 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:23:29,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:23:28" (1/3) ...
[2024-11-07 16:23:29,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518b83b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:29, skipping insertion in model container
[2024-11-07 16:23:29,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:28" (2/3) ...
[2024-11-07 16:23:29,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518b83b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:29, skipping insertion in model container
[2024-11-07 16:23:29,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:29" (3/3) ...
[2024-11-07 16:23:29,211 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_structure-2.i
[2024-11-07 16:23:29,221 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:23:29,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations.
[2024-11-07 16:23:29,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:23:29,252 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;@114e0000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:23:29,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2024-11-07 16:23:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2024-11-07 16:23:29,258 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:29,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1]
[2024-11-07 16:23:29,259 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-11-07 16:23:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times
[2024-11-07 16:23:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737045813]
[2024-11-07 16:23:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737045813]
[2024-11-07 16:23:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737045813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:29,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:29,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:23:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807810443]
[2024-11-07 16:23:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:23:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:23:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:23:29,468 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:29,505 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions.
[2024-11-07 16:23:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:23:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3
[2024-11-07 16:23:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:29,511 INFO L225 Difference]: With dead ends: 30
[2024-11-07 16:23:29,511 INFO L226 Difference]: Without dead ends: 28
[2024-11-07 16:23:29,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:23:29,530 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:29,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2024-11-07 16:23:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2024-11-07 16:23:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.6875) internal successors, (27), 27 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions.
[2024-11-07 16:23:29,555 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3
[2024-11-07 16:23:29,555 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:29,556 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions.
[2024-11-07 16:23:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions.
[2024-11-07 16:23:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2024-11-07 16:23:29,557 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:29,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1]
[2024-11-07 16:23:29,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 16:23:29,558 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-11-07 16:23:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times
[2024-11-07 16:23:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940965482]
[2024-11-07 16:23:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:29,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940965482]
[2024-11-07 16:23:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940965482] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:23:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188519732]
[2024-11-07 16:23:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:29,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:23:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:29,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:23:29,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:23:29,662 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:29,692 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions.
[2024-11-07 16:23:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:23:29,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3
[2024-11-07 16:23:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:29,693 INFO L225 Difference]: With dead ends: 26
[2024-11-07 16:23:29,693 INFO L226 Difference]: Without dead ends: 26
[2024-11-07 16:23:29,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:23:29,694 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:29,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2024-11-07 16:23:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2024-11-07 16:23:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions.
[2024-11-07 16:23:29,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 3
[2024-11-07 16:23:29,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:29,696 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions.
[2024-11-07 16:23:29,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions.
[2024-11-07 16:23:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 16:23:29,698 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:29,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 16:23:29,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 16:23:29,698 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-11-07 16:23:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times
[2024-11-07 16:23:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076113085]
[2024-11-07 16:23:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076113085]
[2024-11-07 16:23:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076113085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:23:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685844398]
[2024-11-07 16:23:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:23:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:23:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:23:29,824 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:29,873 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions.
[2024-11-07 16:23:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:23:29,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4
[2024-11-07 16:23:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:29,874 INFO L225 Difference]: With dead ends: 25
[2024-11-07 16:23:29,874 INFO L226 Difference]: Without dead ends: 25
[2024-11-07 16:23:29,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:23:29,875 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:29,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2024-11-07 16:23:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2024-11-07 16:23:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions.
[2024-11-07 16:23:29,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 4
[2024-11-07 16:23:29,877 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:29,877 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions.
[2024-11-07 16:23:29,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions.
[2024-11-07 16:23:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 16:23:29,879 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:29,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 16:23:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 16:23:29,879 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-11-07 16:23:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times
[2024-11-07 16:23:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141550394]
[2024-11-07 16:23:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141550394]
[2024-11-07 16:23:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141550394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:23:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365337484]
[2024-11-07 16:23:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:23:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:23:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:23:30,035 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:30,077 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions.
[2024-11-07 16:23:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:23:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4
[2024-11-07 16:23:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:30,077 INFO L225 Difference]: With dead ends: 24
[2024-11-07 16:23:30,077 INFO L226 Difference]: Without dead ends: 24
[2024-11-07 16:23:30,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:23:30,078 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 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-11-07 16:23:30,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2024-11-07 16:23:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2024-11-07 16:23:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-07 16:23:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions.
[2024-11-07 16:23:30,081 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 4
[2024-11-07 16:23:30,082 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions.
[2024-11-07 16:23:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions.
[2024-11-07 16:23:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:23:30,082 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:30,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:23:30,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 16:23:30,084 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-11-07 16:23:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times
[2024-11-07 16:23:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597272005]
[2024-11-07 16:23:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597272005]
[2024-11-07 16:23:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597272005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:30,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:30,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:23:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549618623]
[2024-11-07 16:23:30,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:30,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:23:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:23:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:23:30,312 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:30,398 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions.
[2024-11-07 16:23:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:23:30,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:30,399 INFO L225 Difference]: With dead ends: 23
[2024-11-07 16:23:30,399 INFO L226 Difference]: Without dead ends: 23
[2024-11-07 16:23:30,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:23:30,400 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:30,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2024-11-07 16:23:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2024-11-07 16:23:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) 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-11-07 16:23:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions.
[2024-11-07 16:23:30,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 5
[2024-11-07 16:23:30,402 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:30,402 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions.
[2024-11-07 16:23:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions.
[2024-11-07 16:23:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:23:30,402 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:30,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:23:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 16:23:30,402 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-11-07 16:23:30,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times
[2024-11-07 16:23:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980861363]
[2024-11-07 16:23:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980861363]
[2024-11-07 16:23:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980861363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:23:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224435015]
[2024-11-07 16:23:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:23:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:30,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:23:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:23:30,665 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:30,730 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions.
[2024-11-07 16:23:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:23:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:30,732 INFO L225 Difference]: With dead ends: 22
[2024-11-07 16:23:30,732 INFO L226 Difference]: Without dead ends: 22
[2024-11-07 16:23:30,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:23:30,733 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:30,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2024-11-07 16:23:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2024-11-07 16:23:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) 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-11-07 16:23:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions.
[2024-11-07 16:23:30,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 5
[2024-11-07 16:23:30,734 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:30,735 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions.
[2024-11-07 16:23:30,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) 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-11-07 16:23:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions.
[2024-11-07 16:23:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:23:30,735 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:30,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:30,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 16:23:30,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 59261549, now seen corresponding path program 1 times
[2024-11-07 16:23:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744770817]
[2024-11-07 16:23:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744770817]
[2024-11-07 16:23:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744770817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:23:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791874629]
[2024-11-07 16:23:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:23:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:23:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:23:30,788 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-07 16:23:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:30,821 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions.
[2024-11-07 16:23:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:23:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8
[2024-11-07 16:23:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:30,822 INFO L225 Difference]: With dead ends: 21
[2024-11-07 16:23:30,822 INFO L226 Difference]: Without dead ends: 21
[2024-11-07 16:23:30,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:23:30,823 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:30,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2024-11-07 16:23:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2024-11-07 16:23:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) 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-11-07 16:23:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions.
[2024-11-07 16:23:30,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 8
[2024-11-07 16:23:30,825 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:30,825 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions.
[2024-11-07 16:23:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-07 16:23:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions.
[2024-11-07 16:23:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:23:30,825 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:30,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 16:23:30,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:30,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash 59261550, now seen corresponding path program 1 times
[2024-11-07 16:23:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266079983]
[2024-11-07 16:23:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266079983]
[2024-11-07 16:23:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266079983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:23:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570909208]
[2024-11-07 16:23:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:23:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:23:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:23:30,925 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-07 16:23:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:30,957 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions.
[2024-11-07 16:23:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:23:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8
[2024-11-07 16:23:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:30,958 INFO L225 Difference]: With dead ends: 20
[2024-11-07 16:23:30,958 INFO L226 Difference]: Without dead ends: 20
[2024-11-07 16:23:30,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:23:30,959 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:30,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-11-07 16:23:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2024-11-07 16:23:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) 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-11-07 16:23:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions.
[2024-11-07 16:23:30,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 8
[2024-11-07 16:23:30,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:30,960 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions.
[2024-11-07 16:23:30,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-07 16:23:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions.
[2024-11-07 16:23:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-07 16:23:30,961 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:30,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 16:23:30,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108008, now seen corresponding path program 1 times
[2024-11-07 16:23:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442191076]
[2024-11-07 16:23:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442191076]
[2024-11-07 16:23:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442191076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 16:23:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043889381]
[2024-11-07 16:23:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 16:23:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 16:23:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:23:31,124 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:31,196 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions.
[2024-11-07 16:23:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 16:23:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:31,197 INFO L225 Difference]: With dead ends: 19
[2024-11-07 16:23:31,197 INFO L226 Difference]: Without dead ends: 19
[2024-11-07 16:23:31,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-11-07 16:23:31,197 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:31,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2024-11-07 16:23:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2024-11-07 16:23:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.125) 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-11-07 16:23:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions.
[2024-11-07 16:23:31,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 9
[2024-11-07 16:23:31,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:31,201 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions.
[2024-11-07 16:23:31,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions.
[2024-11-07 16:23:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-07 16:23:31,201 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:31,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:31,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 16:23:31,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108009, now seen corresponding path program 1 times
[2024-11-07 16:23:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:31,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768588693]
[2024-11-07 16:23:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:31,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768588693]
[2024-11-07 16:23:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768588693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 16:23:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251545646]
[2024-11-07 16:23:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:31,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 16:23:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 16:23:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:23:31,383 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:31,434 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions.
[2024-11-07 16:23:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 16:23:31,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:31,435 INFO L225 Difference]: With dead ends: 18
[2024-11-07 16:23:31,435 INFO L226 Difference]: Without dead ends: 18
[2024-11-07 16:23:31,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-11-07 16:23:31,435 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:23:31,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2024-11-07 16:23:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2024-11-07 16:23:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.0625) 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-11-07 16:23:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions.
[2024-11-07 16:23:31,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 9
[2024-11-07 16:23:31,437 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:31,437 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions.
[2024-11-07 16:23:31,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) 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-11-07 16:23:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions.
[2024-11-07 16:23:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:23:31,437 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:31,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 16:23:31,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1253225369, now seen corresponding path program 1 times
[2024-11-07 16:23:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:31,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691073184]
[2024-11-07 16:23:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:31,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691073184]
[2024-11-07 16:23:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691073184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:23:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029628314]
[2024-11-07 16:23:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:23:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:23:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:23:31,575 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:31,596 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions.
[2024-11-07 16:23:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:23:31,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:23:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:31,597 INFO L225 Difference]: With dead ends: 17
[2024-11-07 16:23:31,597 INFO L226 Difference]: Without dead ends: 15
[2024-11-07 16:23:31,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:23:31,598 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 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-11-07 16:23:31,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2024-11-07 16:23:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2024-11-07 16:23:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) 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-11-07 16:23:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions.
[2024-11-07 16:23:31,600 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 13
[2024-11-07 16:23:31,600 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions.
[2024-11-07 16:23:31,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:23:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions.
[2024-11-07 16:23:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-07 16:23:31,601 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:23:31,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 16:23:31,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2024-11-07 16:23:31,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:23:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 194879730, now seen corresponding path program 1 times
[2024-11-07 16:23:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 16:23:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099781721]
[2024-11-07 16:23:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:23:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 16:23:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:23:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:23:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 16:23:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099781721]
[2024-11-07 16:23:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099781721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:23:31,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:23:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-07 16:23:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010089493]
[2024-11-07 16:23:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:23:31,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 16:23:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 16:23:31,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 16:23:31,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-07 16:23:31,812 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-11-07 16:23:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:23:31,841 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions.
[2024-11-07 16:23:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 16:23:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2024-11-07 16:23:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:23:31,842 INFO L225 Difference]: With dead ends: 11
[2024-11-07 16:23:31,842 INFO L226 Difference]: Without dead ends: 0
[2024-11-07 16:23:31,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-07 16:23:31,842 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 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-11-07 16:23:31,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:23:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-07 16:23:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-07 16:23:31,843 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-11-07 16:23:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-07 16:23:31,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14
[2024-11-07 16:23:31,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:23:31,843 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 16:23:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-11-07 16:23:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-07 16:23:31,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining)
[2024-11-07 16:23:31,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining)
[2024-11-07 16:23:31,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining)
[2024-11-07 16:23:31,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining)
[2024-11-07 16:23:31,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining)
[2024-11-07 16:23:31,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining)
[2024-11-07 16:23:31,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining)
[2024-11-07 16:23:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 16:23:31,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:23:31,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 16:23:31,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:23:31 BoogieIcfgContainer
[2024-11-07 16:23:31,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 16:23:31,851 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 16:23:31,851 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 16:23:31,851 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 16:23:31,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:29" (3/4) ...
[2024-11-07 16:23:31,852 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-07 16:23:31,857 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-11-07 16:23:31,858 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-11-07 16:23:31,858 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-07 16:23:31,858 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-07 16:23:31,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 16:23:31,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-07 16:23:31,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 16:23:31,898 INFO L158 Benchmark]: Toolchain (without parser) took 3162.52ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 92.0MB in the beginning and 69.1MB in the end (delta: 23.0MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.79ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 81.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.93ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: RCFGBuilder took 277.14ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 65.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: TraceAbstraction took 2644.99ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 73.3MB in the end (delta: -8.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,899 INFO L158 Benchmark]: Witness Printer took 47.22ms. Allocated memory is still 151.0MB. Free memory was 73.3MB in the beginning and 69.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 16:23:31,900 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.72ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 136.79ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 81.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 18.93ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 30.19ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 277.14ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 65.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 2644.99ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 73.3MB in the end (delta: -8.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
* Witness Printer took 47.22ms. Allocated memory is still 151.0MB. Free memory was 73.3MB in the beginning and 69.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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: 12]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 38]: 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, 33 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 167 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11-07 16:23:31,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE