./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 09:57:43,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 09:57:43,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 09:57:43,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 09:57:43,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 09:57:43,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 09:57:43,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 09:57:43,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 09:57:43,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 09:57:43,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 09:57:43,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 09:57:43,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 09:57:43,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 09:57:43,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 09:57:43,168 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 09:57:43,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 09:57:43,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 09:57:43,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 09:57:43,169 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 09:57:43,169 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 09:57:43,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 09:57:43,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 09:57:43,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 09:57:43,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 09:57:43,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 09:57:43,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 09:57:43,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 09:57:43,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 09:57:43,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 09:57:43,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 09:57:43,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:57:43,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 09:57:43,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 09:57:43,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 09:57:43,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 09:57:43,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 09:57:43,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 09:57:43,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 09:57:43,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 09:57:43,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-09 09:57:43,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 09:57:43,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 09:57:43,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 09:57:43,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 09:57:43,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 09:57:43,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-09 09:57:45,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 09:57:45,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 09:57:45,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-09 09:57:45,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547d8adeb/a7603aedf79f44cc9d57ad5bccc7ad79/FLAGf8115d727 [2024-11-09 09:57:45,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547d8adeb/a7603aedf79f44cc9d57ad5bccc7ad79 [2024-11-09 09:57:45,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 09:57:45,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 09:57:45,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 09:57:45,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 09:57:45,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 09:57:45,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:45" (1/1) ... [2024-11-09 09:57:45,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509dea5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:45, skipping insertion in model container [2024-11-09 09:57:45,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:45" (1/1) ... [2024-11-09 09:57:45,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 09:57:46,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,186 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,204 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,209 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,212 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,218 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:46,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:57:46,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 09:57:46,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:57:46,458 INFO L204 MainTranslator]: Completed translation [2024-11-09 09:57:46,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46 WrapperNode [2024-11-09 09:57:46,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 09:57:46,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 09:57:46,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 09:57:46,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 09:57:46,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,588 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 746 [2024-11-09 09:57:46,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 09:57:46,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 09:57:46,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 09:57:46,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 09:57:46,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,679 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 2, 3, 3, 3, 12, 2, 4, 4, 4, 3, 3, 355, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 3, 3, 3, 0, 0, 3, 3, 3, 3, 1, 355, 0]. The 11 writes are split as follows [0, 1, 0, 0, 0, 5, 2, 0, 0, 0, 0, 1, 0, 2]. [2024-11-09 09:57:46,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 09:57:46,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 09:57:46,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 09:57:46,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 09:57:46,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (1/1) ... [2024-11-09 09:57:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:57:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:46,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 09:57:46,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 09:57:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 09:57:46,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 09:57:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 09:57:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 09:57:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 09:57:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 09:57:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 09:57:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 09:57:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 09:57:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 09:57:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 09:57:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 09:57:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 09:57:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 09:57:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 09:57:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 09:57:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 09:57:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 09:57:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 09:57:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 09:57:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 09:57:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 09:57:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 09:57:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 09:57:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 09:57:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 09:57:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 09:57:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 09:57:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 09:57:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 09:57:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 09:57:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 09:57:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 09:57:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 09:57:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 09:57:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 09:57:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 09:57:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 09:57:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 09:57:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 09:57:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 09:57:47,335 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 09:57:47,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 09:57:48,108 INFO L? ?]: Removed 262 outVars from TransFormulas that were not future-live. [2024-11-09 09:57:48,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 09:57:48,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 09:57:48,157 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 09:57:48,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:57:48 BoogieIcfgContainer [2024-11-09 09:57:48,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 09:57:48,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 09:57:48,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 09:57:48,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 09:57:48,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:57:45" (1/3) ... [2024-11-09 09:57:48,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab30207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:48, skipping insertion in model container [2024-11-09 09:57:48,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:46" (2/3) ... [2024-11-09 09:57:48,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab30207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:48, skipping insertion in model container [2024-11-09 09:57:48,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:57:48" (3/3) ... [2024-11-09 09:57:48,176 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-09 09:57:48,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 09:57:48,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 96 error locations. [2024-11-09 09:57:48,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 09:57:48,313 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;@1616f44e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 09:57:48,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-09 09:57:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 250 states, 150 states have (on average 1.9266666666666667) internal successors, (289), 246 states have internal predecessors, (289), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:57:48,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:48,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:57:48,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:48,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2024-11-09 09:57:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832889225] [2024-11-09 09:57:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:48,885 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-09 09:57:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832889225] [2024-11-09 09:57:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832889225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575078420] [2024-11-09 09:57:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:48,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:48,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:48,925 INFO L87 Difference]: Start difference. First operand has 250 states, 150 states have (on average 1.9266666666666667) internal successors, (289), 246 states have internal predecessors, (289), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-09 09:57:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:49,196 INFO L93 Difference]: Finished difference Result 260 states and 292 transitions. [2024-11-09 09:57:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:49,200 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-09 09:57:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:49,210 INFO L225 Difference]: With dead ends: 260 [2024-11-09 09:57:49,210 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 09:57:49,212 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-09 09:57:49,215 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 242 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:49,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 209 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 09:57:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 241. [2024-11-09 09:57:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 146 states have (on average 1.8356164383561644) internal successors, (268), 237 states have internal predecessors, (268), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2024-11-09 09:57:49,270 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 3 [2024-11-09 09:57:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:49,271 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2024-11-09 09:57:49,271 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-09 09:57:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2024-11-09 09:57:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:57:49,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:49,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:57:49,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 09:57:49,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2024-11-09 09:57:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510172039] [2024-11-09 09:57:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:49,577 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-09 09:57:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510172039] [2024-11-09 09:57:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510172039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397030777] [2024-11-09 09:57:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:49,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:49,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:49,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:49,582 INFO L87 Difference]: Start difference. First operand 241 states and 272 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-09 09:57:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:49,744 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2024-11-09 09:57:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:49,745 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-09 09:57:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:49,746 INFO L225 Difference]: With dead ends: 240 [2024-11-09 09:57:49,746 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 09:57:49,747 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-09 09:57:49,748 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:49,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 436 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 09:57:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-09 09:57:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 146 states have (on average 1.8287671232876712) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2024-11-09 09:57:49,771 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 3 [2024-11-09 09:57:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:49,771 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2024-11-09 09:57:49,772 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-09 09:57:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2024-11-09 09:57:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 09:57:49,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:49,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 09:57:49,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 09:57:49,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2024-11-09 09:57:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914458029] [2024-11-09 09:57:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:50,148 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-09 09:57:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914458029] [2024-11-09 09:57:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914458029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:50,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:50,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:57:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303330545] [2024-11-09 09:57:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:57:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:57:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:50,151 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:50,318 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2024-11-09 09:57:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:57:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 09:57:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:50,320 INFO L225 Difference]: With dead ends: 243 [2024-11-09 09:57:50,320 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 09:57:50,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:50,321 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 12 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:50,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 436 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 09:57:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2024-11-09 09:57:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 148 states have (on average 1.8175675675675675) internal successors, (269), 238 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2024-11-09 09:57:50,332 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 6 [2024-11-09 09:57:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2024-11-09 09:57:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2024-11-09 09:57:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 09:57:50,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:50,334 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:50,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 09:57:50,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 71430167, now seen corresponding path program 1 times [2024-11-09 09:57:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375495954] [2024-11-09 09:57:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375495954] [2024-11-09 09:57:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375495954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791885979] [2024-11-09 09:57:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:50,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:50,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 09:57:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:51,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 09:57:51,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:51,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:51,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 09:57:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791885979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:51,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 09:57:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711559581] [2024-11-09 09:57:51,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:51,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 09:57:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 09:57:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:57:51,377 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-09 09:57:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:51,783 INFO L93 Difference]: Finished difference Result 246 states and 277 transitions. [2024-11-09 09:57:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:57:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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) Word has length 9 [2024-11-09 09:57:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:51,785 INFO L225 Difference]: With dead ends: 246 [2024-11-09 09:57:51,785 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 09:57:51,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-09 09:57:51,786 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 516 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:51,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 955 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 09:57:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-09 09:57:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.7843137254901962) internal successors, (273), 242 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2024-11-09 09:57:51,805 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 9 [2024-11-09 09:57:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2024-11-09 09:57:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-09 09:57:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2024-11-09 09:57:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 09:57:51,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:51,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:51,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 09:57:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:52,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:52,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 994856290, now seen corresponding path program 1 times [2024-11-09 09:57:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725197509] [2024-11-09 09:57:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:52,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725197509] [2024-11-09 09:57:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725197509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303969140] [2024-11-09 09:57:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:52,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:52,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:52,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:52,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 09:57:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:52,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:57:52,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:52,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303969140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:52,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 09:57:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585440343] [2024-11-09 09:57:52,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:52,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 09:57:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 09:57:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:57:52,654 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:52,713 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2024-11-09 09:57:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:57:52,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 09:57:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:52,715 INFO L225 Difference]: With dead ends: 261 [2024-11-09 09:57:52,715 INFO L226 Difference]: Without dead ends: 261 [2024-11-09 09:57:52,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:57:52,716 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:52,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 793 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:57:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-09 09:57:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-09 09:57:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 168 states have (on average 1.7142857142857142) internal successors, (288), 257 states have internal predecessors, (288), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 292 transitions. [2024-11-09 09:57:52,732 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 292 transitions. Word has length 16 [2024-11-09 09:57:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:52,733 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 292 transitions. [2024-11-09 09:57:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 292 transitions. [2024-11-09 09:57:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 09:57:52,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:52,734 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:52,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 09:57:52,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:52,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -23468336, now seen corresponding path program 2 times [2024-11-09 09:57:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159623538] [2024-11-09 09:57:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159623538] [2024-11-09 09:57:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159623538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086752885] [2024-11-09 09:57:53,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 09:57:53,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:53,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:53,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:53,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 09:57:53,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 09:57:53,627 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:57:53,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 09:57:53,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:53,695 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 09:57:53,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 09:57:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 09:57:53,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 09:57:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086752885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 09:57:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [11] total 12 [2024-11-09 09:57:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593647041] [2024-11-09 09:57:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:57:53,856 INFO L87 Difference]: Start difference. First operand 261 states and 292 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:53,976 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2024-11-09 09:57:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 09:57:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:53,977 INFO L225 Difference]: With dead ends: 277 [2024-11-09 09:57:53,977 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 09:57:53,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:57:53,978 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 241 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:53,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 204 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 09:57:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 260. [2024-11-09 09:57:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 168 states have (on average 1.7083333333333333) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2024-11-09 09:57:53,988 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 31 [2024-11-09 09:57:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:53,989 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2024-11-09 09:57:53,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2024-11-09 09:57:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 09:57:53,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:53,993 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:54,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 09:57:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:54,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -23468335, now seen corresponding path program 1 times [2024-11-09 09:57:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:54,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104868825] [2024-11-09 09:57:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104868825] [2024-11-09 09:57:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104868825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220525241] [2024-11-09 09:57:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:54,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:54,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 09:57:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:54,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 09:57:54,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:54,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220525241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:55,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-09 09:57:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309123653] [2024-11-09 09:57:55,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 09:57:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 09:57:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:57:55,044 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:55,108 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions. [2024-11-09 09:57:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:57:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 09:57:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:55,109 INFO L225 Difference]: With dead ends: 266 [2024-11-09 09:57:55,110 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 09:57:55,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:57:55,111 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 2 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:55,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1052 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:57:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 09:57:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-09 09:57:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 174 states have (on average 1.6839080459770115) internal successors, (293), 262 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 297 transitions. [2024-11-09 09:57:55,116 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 297 transitions. Word has length 31 [2024-11-09 09:57:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 297 transitions. [2024-11-09 09:57:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 297 transitions. [2024-11-09 09:57:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 09:57:55,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:55,118 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:55,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 09:57:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:55,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1894060655, now seen corresponding path program 2 times [2024-11-09 09:57:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491926930] [2024-11-09 09:57:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491926930] [2024-11-09 09:57:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491926930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:57:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439168106] [2024-11-09 09:57:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:57:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:57:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:55,788 INFO L87 Difference]: Start difference. First operand 266 states and 297 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:56,044 INFO L93 Difference]: Finished difference Result 282 states and 314 transitions. [2024-11-09 09:57:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:57:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 09:57:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:56,047 INFO L225 Difference]: With dead ends: 282 [2024-11-09 09:57:56,051 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 09:57:56,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:56,052 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 516 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:56,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 154 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 09:57:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 265. [2024-11-09 09:57:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 174 states have (on average 1.6781609195402298) internal successors, (292), 261 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 296 transitions. [2024-11-09 09:57:56,063 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 296 transitions. Word has length 37 [2024-11-09 09:57:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:56,068 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 296 transitions. [2024-11-09 09:57:56,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 296 transitions. [2024-11-09 09:57:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 09:57:56,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:56,069 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:56,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 09:57:56,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:56,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1983337925, now seen corresponding path program 1 times [2024-11-09 09:57:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258597620] [2024-11-09 09:57:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258597620] [2024-11-09 09:57:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258597620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:56,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:56,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758628662] [2024-11-09 09:57:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:56,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:56,476 INFO L87 Difference]: Start difference. First operand 265 states and 296 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:56,619 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2024-11-09 09:57:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:56,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-09 09:57:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:56,621 INFO L225 Difference]: With dead ends: 277 [2024-11-09 09:57:56,621 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 09:57:56,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 09:57:56,622 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 221 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:56,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 212 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 09:57:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 260. [2024-11-09 09:57:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2024-11-09 09:57:56,628 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 45 [2024-11-09 09:57:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:56,629 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2024-11-09 09:57:56,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2024-11-09 09:57:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 09:57:56,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:56,633 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:56,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 09:57:56,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:56,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1983337924, now seen corresponding path program 1 times [2024-11-09 09:57:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296905688] [2024-11-09 09:57:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296905688] [2024-11-09 09:57:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296905688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:57:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169837844] [2024-11-09 09:57:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:57,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:57,424 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:57,752 INFO L93 Difference]: Finished difference Result 423 states and 484 transitions. [2024-11-09 09:57:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:57:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-09 09:57:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:57,755 INFO L225 Difference]: With dead ends: 423 [2024-11-09 09:57:57,755 INFO L226 Difference]: Without dead ends: 423 [2024-11-09 09:57:57,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:57,755 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 413 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:57,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 827 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-09 09:57:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 259. [2024-11-09 09:57:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-09 09:57:57,764 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 45 [2024-11-09 09:57:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-09 09:57:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-09 09:57:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 09:57:57,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:57,766 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 09:57:57,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:57,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 244978578, now seen corresponding path program 1 times [2024-11-09 09:57:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992296764] [2024-11-09 09:57:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:58,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:58,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992296764] [2024-11-09 09:57:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992296764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:57:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483996283] [2024-11-09 09:57:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:58,202 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:58,489 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2024-11-09 09:57:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:58,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-11-09 09:57:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:58,491 INFO L225 Difference]: With dead ends: 296 [2024-11-09 09:57:58,491 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 09:57:58,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:58,491 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 303 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:58,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 319 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 09:57:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2024-11-09 09:57:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 188 states have (on average 1.6329787234042554) internal successors, (307), 268 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 311 transitions. [2024-11-09 09:57:58,497 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 311 transitions. Word has length 48 [2024-11-09 09:57:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:58,497 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 311 transitions. [2024-11-09 09:57:58,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 311 transitions. [2024-11-09 09:57:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 09:57:58,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:58,499 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 09:57:58,499 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -995599198, now seen corresponding path program 1 times [2024-11-09 09:57:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:58,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421182842] [2024-11-09 09:57:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421182842] [2024-11-09 09:57:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421182842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:58,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:57:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560958294] [2024-11-09 09:57:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:57:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:58,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:57:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:58,727 INFO L87 Difference]: Start difference. First operand 272 states and 311 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:58,900 INFO L93 Difference]: Finished difference Result 306 states and 352 transitions. [2024-11-09 09:57:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:57:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-09 09:57:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:58,902 INFO L225 Difference]: With dead ends: 306 [2024-11-09 09:57:58,902 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 09:57:58,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:58,902 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 375 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:58,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 289 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 09:57:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 265. [2024-11-09 09:57:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5957446808510638) internal successors, (300), 261 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2024-11-09 09:57:58,921 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 49 [2024-11-09 09:57:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:58,923 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2024-11-09 09:57:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2024-11-09 09:57:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 09:57:58,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:58,928 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 09:57:58,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -995599197, now seen corresponding path program 1 times [2024-11-09 09:57:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160508425] [2024-11-09 09:57:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160508425] [2024-11-09 09:57:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160508425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:57:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824109192] [2024-11-09 09:57:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:59,289 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:59,365 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2024-11-09 09:57:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:57:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-09 09:57:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:59,367 INFO L225 Difference]: With dead ends: 272 [2024-11-09 09:57:59,368 INFO L226 Difference]: Without dead ends: 272 [2024-11-09 09:57:59,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:59,368 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 236 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:59,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 966 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-09 09:57:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-11-09 09:57:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5904255319148937) internal successors, (299), 261 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions. [2024-11-09 09:57:59,374 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 49 [2024-11-09 09:57:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:59,375 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 303 transitions. [2024-11-09 09:57:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions. [2024-11-09 09:57:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 09:57:59,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:59,376 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 09:57:59,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1007374377, now seen corresponding path program 1 times [2024-11-09 09:57:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945460882] [2024-11-09 09:57:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:57:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945460882] [2024-11-09 09:57:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945460882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:59,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247158161] [2024-11-09 09:57:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:59,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:59,734 INFO L87 Difference]: Start difference. First operand 265 states and 303 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:59,850 INFO L93 Difference]: Finished difference Result 271 states and 311 transitions. [2024-11-09 09:57:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-11-09 09:57:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:59,851 INFO L225 Difference]: With dead ends: 271 [2024-11-09 09:57:59,851 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 09:57:59,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09 09:57:59,852 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 207 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:59,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 208 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 09:57:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2024-11-09 09:57:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.5824742268041236) internal successors, (307), 266 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2024-11-09 09:57:59,858 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 51 [2024-11-09 09:57:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:59,859 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2024-11-09 09:57:59,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2024-11-09 09:57:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 09:57:59,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:59,860 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:59,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 09:57:59,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:57:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1007374378, now seen corresponding path program 1 times [2024-11-09 09:57:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116785087] [2024-11-09 09:57:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116785087] [2024-11-09 09:58:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116785087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:00,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:58:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343002303] [2024-11-09 09:58:00,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:58:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:58:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:58:00,538 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:00,952 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2024-11-09 09:58:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-11-09 09:58:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:00,954 INFO L225 Difference]: With dead ends: 282 [2024-11-09 09:58:00,954 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 09:58:00,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:00,955 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 483 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:00,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 411 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 09:58:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 09:58:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 270. [2024-11-09 09:58:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.577319587628866) internal successors, (306), 266 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 310 transitions. [2024-11-09 09:58:00,963 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 310 transitions. Word has length 51 [2024-11-09 09:58:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:00,963 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 310 transitions. [2024-11-09 09:58:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 310 transitions. [2024-11-09 09:58:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 09:58:00,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:00,964 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:00,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 09:58:00,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:00,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1753597880, now seen corresponding path program 1 times [2024-11-09 09:58:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836325819] [2024-11-09 09:58:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836325819] [2024-11-09 09:58:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836325819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657985510] [2024-11-09 09:58:01,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:58:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:58:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:58:01,332 INFO L87 Difference]: Start difference. First operand 270 states and 310 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:01,575 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2024-11-09 09:58:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:58:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 09:58:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:01,577 INFO L225 Difference]: With dead ends: 269 [2024-11-09 09:58:01,577 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 09:58:01,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 09:58:01,578 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 14 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:01,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 726 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 09:58:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 09:58:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 194 states have (on average 1.5670103092783505) internal successors, (304), 265 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2024-11-09 09:58:01,583 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 54 [2024-11-09 09:58:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2024-11-09 09:58:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2024-11-09 09:58:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 09:58:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:01,585 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 09:58:01,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1753597881, now seen corresponding path program 1 times [2024-11-09 09:58:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045837626] [2024-11-09 09:58:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045837626] [2024-11-09 09:58:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045837626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:02,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:02,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664930199] [2024-11-09 09:58:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:58:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:58:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:58:02,192 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:02,435 INFO L93 Difference]: Finished difference Result 268 states and 306 transitions. [2024-11-09 09:58:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:58:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 09:58:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:02,437 INFO L225 Difference]: With dead ends: 268 [2024-11-09 09:58:02,437 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 09:58:02,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 09:58:02,438 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 13 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:02,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 728 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 09:58:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-09 09:58:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 194 states have (on average 1.556701030927835) internal successors, (302), 264 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2024-11-09 09:58:02,443 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 54 [2024-11-09 09:58:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:02,444 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2024-11-09 09:58:02,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2024-11-09 09:58:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 09:58:02,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:02,445 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 09:58:02,445 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -216475537, now seen corresponding path program 1 times [2024-11-09 09:58:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719798136] [2024-11-09 09:58:02,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:02,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:02,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719798136] [2024-11-09 09:58:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719798136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523642142] [2024-11-09 09:58:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:02,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:58:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:58:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:58:02,689 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:02,876 INFO L93 Difference]: Finished difference Result 267 states and 304 transitions. [2024-11-09 09:58:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:58:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-09 09:58:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:02,878 INFO L225 Difference]: With dead ends: 267 [2024-11-09 09:58:02,878 INFO L226 Difference]: Without dead ends: 267 [2024-11-09 09:58:02,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 09:58:02,879 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:02,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 785 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-09 09:58:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-09 09:58:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 263 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 304 transitions. [2024-11-09 09:58:02,886 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 304 transitions. Word has length 59 [2024-11-09 09:58:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:02,886 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 304 transitions. [2024-11-09 09:58:02,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 304 transitions. [2024-11-09 09:58:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 09:58:02,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:02,887 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 09:58:02,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -216475536, now seen corresponding path program 1 times [2024-11-09 09:58:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572824513] [2024-11-09 09:58:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:03,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:03,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572824513] [2024-11-09 09:58:03,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572824513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:03,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:03,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:58:03,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950437669] [2024-11-09 09:58:03,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:03,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:58:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:58:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:58:03,728 INFO L87 Difference]: Start difference. First operand 267 states and 304 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:04,012 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2024-11-09 09:58:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-09 09:58:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:04,014 INFO L225 Difference]: With dead ends: 277 [2024-11-09 09:58:04,014 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 09:58:04,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 09:58:04,014 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 16 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:04,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 725 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:58:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 09:58:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-11-09 09:58:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.5297029702970297) internal successors, (309), 271 states have internal predecessors, (309), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 313 transitions. [2024-11-09 09:58:04,019 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 313 transitions. Word has length 59 [2024-11-09 09:58:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:04,020 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 313 transitions. [2024-11-09 09:58:04,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 313 transitions. [2024-11-09 09:58:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 09:58:04,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:04,021 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 09:58:04,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1826213462, now seen corresponding path program 1 times [2024-11-09 09:58:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262453649] [2024-11-09 09:58:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:04,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262453649] [2024-11-09 09:58:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262453649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716865228] [2024-11-09 09:58:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:04,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:04,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:04,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 09:58:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:05,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 09:58:05,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 09:58:05,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 09:58:05,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 09:58:05,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2024-11-09 09:58:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2024-11-09 09:58:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:05,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716865228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:05,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2024-11-09 09:58:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670950297] [2024-11-09 09:58:05,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:05,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 09:58:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:05,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 09:58:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:58:05,750 INFO L87 Difference]: Start difference. First operand 275 states and 313 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:06,635 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2024-11-09 09:58:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 09:58:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-09 09:58:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:06,638 INFO L225 Difference]: With dead ends: 288 [2024-11-09 09:58:06,638 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 09:58:06,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2024-11-09 09:58:06,639 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 29 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:06,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2282 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 09:58:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 09:58:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-09 09:58:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 216 states have (on average 1.4907407407407407) internal successors, (322), 284 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 326 transitions. [2024-11-09 09:58:06,649 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 326 transitions. Word has length 64 [2024-11-09 09:58:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:06,649 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 326 transitions. [2024-11-09 09:58:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 326 transitions. [2024-11-09 09:58:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 09:58:06,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:06,650 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:06,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 09:58:06,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:06,851 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:06,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1054215480, now seen corresponding path program 1 times [2024-11-09 09:58:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325685427] [2024-11-09 09:58:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:06,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:07,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325685427] [2024-11-09 09:58:07,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325685427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136072860] [2024-11-09 09:58:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:07,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:07,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:07,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 09:58:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:07,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:58:07,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:07,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136072860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:07,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 09:58:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119947790] [2024-11-09 09:58:07,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:07,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 09:58:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 09:58:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:07,621 INFO L87 Difference]: Start difference. First operand 288 states and 326 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:07,667 INFO L93 Difference]: Finished difference Result 345 states and 381 transitions. [2024-11-09 09:58:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:58:07,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-09 09:58:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:07,669 INFO L225 Difference]: With dead ends: 345 [2024-11-09 09:58:07,669 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 09:58:07,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:07,670 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 24 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:07,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 748 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 09:58:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 338. [2024-11-09 09:58:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.4172932330827068) internal successors, (377), 334 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 381 transitions. [2024-11-09 09:58:07,678 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 381 transitions. Word has length 75 [2024-11-09 09:58:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:07,679 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 381 transitions. [2024-11-09 09:58:07,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 381 transitions. [2024-11-09 09:58:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 09:58:07,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:07,680 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:07,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 09:58:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:07,881 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -592392318, now seen corresponding path program 2 times [2024-11-09 09:58:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80079487] [2024-11-09 09:58:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80079487] [2024-11-09 09:58:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80079487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43380303] [2024-11-09 09:58:08,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 09:58:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:08,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:08,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 09:58:08,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 09:58:08,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:58:08,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 09:58:08,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:08,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43380303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:08,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-09 09:58:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273694201] [2024-11-09 09:58:08,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:08,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 09:58:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 09:58:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:08,963 INFO L87 Difference]: Start difference. First operand 338 states and 381 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:09,003 INFO L93 Difference]: Finished difference Result 367 states and 403 transitions. [2024-11-09 09:58:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-09 09:58:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:09,005 INFO L225 Difference]: With dead ends: 367 [2024-11-09 09:58:09,005 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 09:58:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 192 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:09,006 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 25 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:09,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 990 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 09:58:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 358. [2024-11-09 09:58:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 286 states have (on average 1.3951048951048952) internal successors, (399), 354 states have internal predecessors, (399), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-11-09 09:58:09,014 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 100 [2024-11-09 09:58:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:09,014 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-11-09 09:58:09,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-11-09 09:58:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 09:58:09,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:09,015 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:09,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 09:58:09,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:09,216 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:09,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1911546690, now seen corresponding path program 3 times [2024-11-09 09:58:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021277150] [2024-11-09 09:58:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021277150] [2024-11-09 09:58:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021277150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221206687] [2024-11-09 09:58:10,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 09:58:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:10,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:10,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:10,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 09:58:10,662 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 09:58:10,662 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:58:10,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 09:58:10,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:10,735 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:10,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 09:58:10,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 09:58:10,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-09 09:58:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:11,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 09:58:11,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:11,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:11,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:12,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 09:58:12,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2024-11-09 09:58:12,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-09 09:58:12,957 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 09:58:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-11-09 09:58:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221206687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:12,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2024-11-09 09:58:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111504255] [2024-11-09 09:58:12,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 09:58:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 09:58:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:58:13,000 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:13,836 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2024-11-09 09:58:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 09:58:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-09 09:58:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:13,838 INFO L225 Difference]: With dead ends: 364 [2024-11-09 09:58:13,839 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 09:58:13,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2024-11-09 09:58:13,839 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 673 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:13,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1253 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 09:58:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 09:58:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 299. [2024-11-09 09:58:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 231 states have (on average 1.4285714285714286) internal successors, (330), 295 states have internal predecessors, (330), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 334 transitions. [2024-11-09 09:58:13,846 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 334 transitions. Word has length 110 [2024-11-09 09:58:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 334 transitions. [2024-11-09 09:58:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 21 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 334 transitions. [2024-11-09 09:58:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 09:58:13,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:13,847 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:13,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 09:58:14,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 09:58:14,048 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash -871595277, now seen corresponding path program 1 times [2024-11-09 09:58:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929196775] [2024-11-09 09:58:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929196775] [2024-11-09 09:58:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929196775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723911354] [2024-11-09 09:58:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:14,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:14,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:14,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:14,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 09:58:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:15,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 09:58:15,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:15,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 09:58:15,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:15,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:15,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:16,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-09 09:58:16,077 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 09:58:16,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-09 09:58:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723911354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:16,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 09:58:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125177801] [2024-11-09 09:58:16,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:16,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 09:58:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 09:58:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-09 09:58:16,118 INFO L87 Difference]: Start difference. First operand 299 states and 334 transitions. Second operand has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:16,676 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2024-11-09 09:58:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 09:58:16,677 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2024-11-09 09:58:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:16,679 INFO L225 Difference]: With dead ends: 365 [2024-11-09 09:58:16,679 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 09:58:16,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2024-11-09 09:58:16,680 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1374 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:16,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 645 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 09:58:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 09:58:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 296. [2024-11-09 09:58:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.4155844155844155) internal successors, (327), 292 states have internal predecessors, (327), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 331 transitions. [2024-11-09 09:58:16,688 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 331 transitions. Word has length 111 [2024-11-09 09:58:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 331 transitions. [2024-11-09 09:58:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 331 transitions. [2024-11-09 09:58:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 09:58:16,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:16,690 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:16,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:16,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 09:58:16,894 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash -83942790, now seen corresponding path program 1 times [2024-11-09 09:58:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983704998] [2024-11-09 09:58:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983704998] [2024-11-09 09:58:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983704998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082431942] [2024-11-09 09:58:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:18,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:18,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:18,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:18,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 09:58:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:19,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 09:58:19,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:19,222 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 09:58:19,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 09:58:19,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 09:58:19,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:19,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:19,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-09 09:58:19,478 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 09:58:19,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 09:58:21,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:21,053 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 09:58:21,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2024-11-09 09:58:21,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:21,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:21,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:22,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 09:58:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-09 09:58:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082431942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:22,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2024-11-09 09:58:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339105162] [2024-11-09 09:58:22,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 09:58:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 09:58:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-11-09 09:58:22,597 INFO L87 Difference]: Start difference. First operand 296 states and 331 transitions. Second operand has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:24,737 INFO L93 Difference]: Finished difference Result 482 states and 522 transitions. [2024-11-09 09:58:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-09 09:58:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:24,740 INFO L225 Difference]: With dead ends: 482 [2024-11-09 09:58:24,740 INFO L226 Difference]: Without dead ends: 482 [2024-11-09 09:58:24,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-11-09 09:58:24,741 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1339 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:24,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1375 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 09:58:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-09 09:58:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 291. [2024-11-09 09:58:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.4185022026431717) internal successors, (322), 287 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 326 transitions. [2024-11-09 09:58:24,749 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 326 transitions. Word has length 113 [2024-11-09 09:58:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 326 transitions. [2024-11-09 09:58:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 326 transitions. [2024-11-09 09:58:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 09:58:24,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:24,750 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:24,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 09:58:24,951 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1677526631, now seen corresponding path program 1 times [2024-11-09 09:58:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864641394] [2024-11-09 09:58:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864641394] [2024-11-09 09:58:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864641394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:58:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247879548] [2024-11-09 09:58:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:25,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:58:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:58:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:58:25,538 INFO L87 Difference]: Start difference. First operand 291 states and 326 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:25,766 INFO L93 Difference]: Finished difference Result 338 states and 384 transitions. [2024-11-09 09:58:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:58:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2024-11-09 09:58:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:25,767 INFO L225 Difference]: With dead ends: 338 [2024-11-09 09:58:25,767 INFO L226 Difference]: Without dead ends: 338 [2024-11-09 09:58:25,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:25,768 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 357 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:25,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 672 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-09 09:58:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 294. [2024-11-09 09:58:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 290 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2024-11-09 09:58:25,783 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 114 [2024-11-09 09:58:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:25,783 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2024-11-09 09:58:25,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2024-11-09 09:58:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 09:58:25,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:25,785 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 09:58:25,785 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:25,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1490505751, now seen corresponding path program 1 times [2024-11-09 09:58:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970418344] [2024-11-09 09:58:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970418344] [2024-11-09 09:58:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970418344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319709451] [2024-11-09 09:58:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:26,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:26,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 09:58:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 09:58:26,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:26,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:27,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 09:58:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319709451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:27,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 09:58:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764544738] [2024-11-09 09:58:27,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:27,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 09:58:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:27,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 09:58:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:58:27,055 INFO L87 Difference]: Start difference. First operand 294 states and 330 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:27,430 INFO L93 Difference]: Finished difference Result 426 states and 475 transitions. [2024-11-09 09:58:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 09:58:27,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-09 09:58:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:27,432 INFO L225 Difference]: With dead ends: 426 [2024-11-09 09:58:27,432 INFO L226 Difference]: Without dead ends: 426 [2024-11-09 09:58:27,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:58:27,433 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 295 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:27,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 998 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:58:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-09 09:58:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 339. [2024-11-09 09:58:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 275 states have (on average 1.4472727272727273) internal successors, (398), 334 states have internal predecessors, (398), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 09:58:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 404 transitions. [2024-11-09 09:58:27,446 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 404 transitions. Word has length 116 [2024-11-09 09:58:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:27,446 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 404 transitions. [2024-11-09 09:58:27,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 404 transitions. [2024-11-09 09:58:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 09:58:27,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:27,447 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:27,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 09:58:27,656 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:27,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -92028026, now seen corresponding path program 1 times [2024-11-09 09:58:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666351643] [2024-11-09 09:58:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666351643] [2024-11-09 09:58:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666351643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258992099] [2024-11-09 09:58:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:29,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:29,880 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:29,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 09:58:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:30,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 09:58:30,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:30,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 09:58:30,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 09:58:30,528 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-09 09:58:30,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 09:58:30,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:30,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 09:58:31,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 09:58:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:31,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:31,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258992099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:31,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:31,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2024-11-09 09:58:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092017772] [2024-11-09 09:58:31,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:31,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 09:58:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 09:58:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-09 09:58:31,622 INFO L87 Difference]: Start difference. First operand 339 states and 404 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:31,980 INFO L93 Difference]: Finished difference Result 569 states and 690 transitions. [2024-11-09 09:58:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2024-11-09 09:58:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:31,983 INFO L225 Difference]: With dead ends: 569 [2024-11-09 09:58:31,983 INFO L226 Difference]: Without dead ends: 569 [2024-11-09 09:58:31,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-11-09 09:58:31,984 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1248 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:31,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 2405 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-09 09:58:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 404. [2024-11-09 09:58:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 340 states have (on average 1.3676470588235294) internal successors, (465), 399 states have internal predecessors, (465), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 09:58:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 471 transitions. [2024-11-09 09:58:31,993 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 471 transitions. Word has length 117 [2024-11-09 09:58:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:31,993 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 471 transitions. [2024-11-09 09:58:31,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 471 transitions. [2024-11-09 09:58:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 09:58:31,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:31,995 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:32,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:32,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 09:58:32,196 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1038961600, now seen corresponding path program 1 times [2024-11-09 09:58:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128699883] [2024-11-09 09:58:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128699883] [2024-11-09 09:58:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128699883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255810579] [2024-11-09 09:58:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:33,162 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:33,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 09:58:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:33,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 09:58:33,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:33,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:33,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 09:58:33,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 09:58:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-09 09:58:34,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:34,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-09 09:58:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 09:58:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-09 09:58:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255810579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:34,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:34,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2024-11-09 09:58:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058231089] [2024-11-09 09:58:34,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:34,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 09:58:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 09:58:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2024-11-09 09:58:34,272 INFO L87 Difference]: Start difference. First operand 404 states and 471 transitions. Second operand has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:34,632 INFO L93 Difference]: Finished difference Result 568 states and 690 transitions. [2024-11-09 09:58:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 09:58:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2024-11-09 09:58:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:34,635 INFO L225 Difference]: With dead ends: 568 [2024-11-09 09:58:34,635 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 09:58:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2024-11-09 09:58:34,636 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 746 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:34,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 3030 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:58:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 09:58:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 517. [2024-11-09 09:58:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 510 states have internal predecessors, (655), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 665 transitions. [2024-11-09 09:58:34,653 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 665 transitions. Word has length 117 [2024-11-09 09:58:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:34,653 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 665 transitions. [2024-11-09 09:58:34,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 665 transitions. [2024-11-09 09:58:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 09:58:34,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:34,655 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:34,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 09:58:34,855 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1043430180, now seen corresponding path program 1 times [2024-11-09 09:58:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300025910] [2024-11-09 09:58:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:35,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300025910] [2024-11-09 09:58:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300025910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:35,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:35,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 09:58:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300225623] [2024-11-09 09:58:35,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:58:35,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:35,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:58:35,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:58:35,348 INFO L87 Difference]: Start difference. First operand 517 states and 665 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:35,436 INFO L93 Difference]: Finished difference Result 559 states and 713 transitions. [2024-11-09 09:58:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:35,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2024-11-09 09:58:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:35,438 INFO L225 Difference]: With dead ends: 559 [2024-11-09 09:58:35,439 INFO L226 Difference]: Without dead ends: 559 [2024-11-09 09:58:35,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:35,440 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 41 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:35,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1330 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-09 09:58:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 515. [2024-11-09 09:58:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 449 states have (on average 1.4365256124721604) internal successors, (645), 508 states have internal predecessors, (645), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 655 transitions. [2024-11-09 09:58:35,449 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 655 transitions. Word has length 117 [2024-11-09 09:58:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 655 transitions. [2024-11-09 09:58:35,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 655 transitions. [2024-11-09 09:58:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 09:58:35,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:35,451 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 09:58:35,451 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2143038058, now seen corresponding path program 1 times [2024-11-09 09:58:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457299074] [2024-11-09 09:58:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457299074] [2024-11-09 09:58:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457299074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741761671] [2024-11-09 09:58:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:36,444 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 09:58:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:36,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 09:58:36,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:36,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:36,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 09:58:36,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:37,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 09:58:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:37,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:37,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-09 09:58:37,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 09:58:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741761671] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:37,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 16 [2024-11-09 09:58:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523786813] [2024-11-09 09:58:37,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 09:58:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 09:58:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-09 09:58:37,302 INFO L87 Difference]: Start difference. First operand 515 states and 655 transitions. Second operand has 17 states, 16 states have (on average 5.3125) internal successors, (85), 17 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:37,522 INFO L93 Difference]: Finished difference Result 559 states and 679 transitions. [2024-11-09 09:58:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 09:58:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.3125) internal successors, (85), 17 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2024-11-09 09:58:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:37,524 INFO L225 Difference]: With dead ends: 559 [2024-11-09 09:58:37,525 INFO L226 Difference]: Without dead ends: 559 [2024-11-09 09:58:37,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-09 09:58:37,525 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 351 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:37,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1955 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-09 09:58:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 516. [2024-11-09 09:58:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 450 states have (on average 1.4355555555555555) internal successors, (646), 509 states have internal predecessors, (646), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 656 transitions. [2024-11-09 09:58:37,534 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 656 transitions. Word has length 118 [2024-11-09 09:58:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:37,535 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 656 transitions. [2024-11-09 09:58:37,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.3125) internal successors, (85), 17 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 656 transitions. [2024-11-09 09:58:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 09:58:37,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:37,536 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:37,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 09:58:37,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:37,737 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2143083802, now seen corresponding path program 1 times [2024-11-09 09:58:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64234256] [2024-11-09 09:58:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:37,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:37,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64234256] [2024-11-09 09:58:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64234256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:37,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:37,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527094397] [2024-11-09 09:58:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:37,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:37,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:37,873 INFO L87 Difference]: Start difference. First operand 516 states and 656 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:37,915 INFO L93 Difference]: Finished difference Result 515 states and 654 transitions. [2024-11-09 09:58:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:37,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2024-11-09 09:58:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:37,917 INFO L225 Difference]: With dead ends: 515 [2024-11-09 09:58:37,917 INFO L226 Difference]: Without dead ends: 515 [2024-11-09 09:58:37,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 09:58:37,918 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 176 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:37,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 250 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-09 09:58:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2024-11-09 09:58:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.431111111111111) internal successors, (644), 508 states have internal predecessors, (644), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 654 transitions. [2024-11-09 09:58:37,927 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 654 transitions. Word has length 118 [2024-11-09 09:58:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:37,927 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 654 transitions. [2024-11-09 09:58:37,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 654 transitions. [2024-11-09 09:58:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 09:58:37,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:37,929 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:37,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 09:58:37,929 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2009669886, now seen corresponding path program 1 times [2024-11-09 09:58:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841230444] [2024-11-09 09:58:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:38,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841230444] [2024-11-09 09:58:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841230444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766842068] [2024-11-09 09:58:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:38,805 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:38,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 09:58:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:39,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 09:58:39,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:39,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 09:58:39,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:39,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 09:58:39,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 09:58:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:39,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-09 09:58:39,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 09:58:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766842068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2024-11-09 09:58:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497216377] [2024-11-09 09:58:39,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:39,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 09:58:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 09:58:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 09:58:39,773 INFO L87 Difference]: Start difference. First operand 515 states and 654 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:40,356 INFO L93 Difference]: Finished difference Result 545 states and 661 transitions. [2024-11-09 09:58:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2024-11-09 09:58:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:40,358 INFO L225 Difference]: With dead ends: 545 [2024-11-09 09:58:40,358 INFO L226 Difference]: Without dead ends: 545 [2024-11-09 09:58:40,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-09 09:58:40,359 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 332 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:40,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 2225 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-09 09:58:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 516. [2024-11-09 09:58:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 451 states have (on average 1.4301552106430155) internal successors, (645), 509 states have internal predecessors, (645), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 655 transitions. [2024-11-09 09:58:40,369 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 655 transitions. Word has length 119 [2024-11-09 09:58:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:40,369 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 655 transitions. [2024-11-09 09:58:40,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 655 transitions. [2024-11-09 09:58:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 09:58:40,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:40,370 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:40,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:40,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:40,571 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:40,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2127993722, now seen corresponding path program 1 times [2024-11-09 09:58:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:40,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423002396] [2024-11-09 09:58:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423002396] [2024-11-09 09:58:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423002396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:40,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:40,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258555250] [2024-11-09 09:58:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:40,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:40,791 INFO L87 Difference]: Start difference. First operand 516 states and 655 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:40,811 INFO L93 Difference]: Finished difference Result 514 states and 646 transitions. [2024-11-09 09:58:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2024-11-09 09:58:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:40,813 INFO L225 Difference]: With dead ends: 514 [2024-11-09 09:58:40,813 INFO L226 Difference]: Without dead ends: 514 [2024-11-09 09:58:40,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 09:58:40,814 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:40,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-09 09:58:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-11-09 09:58:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 449 states have (on average 1.4164810690423162) internal successors, (636), 507 states have internal predecessors, (636), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 646 transitions. [2024-11-09 09:58:40,823 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 646 transitions. Word has length 120 [2024-11-09 09:58:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 646 transitions. [2024-11-09 09:58:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 646 transitions. [2024-11-09 09:58:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 09:58:40,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:40,825 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 09:58:40,825 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 79790336, now seen corresponding path program 1 times [2024-11-09 09:58:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960521344] [2024-11-09 09:58:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960521344] [2024-11-09 09:58:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960521344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:41,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979156370] [2024-11-09 09:58:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:41,114 INFO L87 Difference]: Start difference. First operand 514 states and 646 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:41,158 INFO L93 Difference]: Finished difference Result 513 states and 645 transitions. [2024-11-09 09:58:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2024-11-09 09:58:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:41,161 INFO L225 Difference]: With dead ends: 513 [2024-11-09 09:58:41,161 INFO L226 Difference]: Without dead ends: 513 [2024-11-09 09:58:41,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 09:58:41,162 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 179 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:41,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 243 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-09 09:58:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2024-11-09 09:58:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 449 states have (on average 1.4142538975501113) internal successors, (635), 506 states have internal predecessors, (635), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 645 transitions. [2024-11-09 09:58:41,172 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 645 transitions. Word has length 121 [2024-11-09 09:58:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:41,173 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 645 transitions. [2024-11-09 09:58:41,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 645 transitions. [2024-11-09 09:58:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 09:58:41,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:41,174 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:41,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 09:58:41,175 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002747, now seen corresponding path program 1 times [2024-11-09 09:58:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253578864] [2024-11-09 09:58:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253578864] [2024-11-09 09:58:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253578864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233004673] [2024-11-09 09:58:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:41,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:41,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:41,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:41,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 09:58:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:42,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 09:58:42,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:42,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:42,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233004673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:42,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:42,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 09:58:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955085502] [2024-11-09 09:58:42,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:42,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 09:58:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 09:58:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:42,282 INFO L87 Difference]: Start difference. First operand 513 states and 645 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:42,334 INFO L93 Difference]: Finished difference Result 596 states and 709 transitions. [2024-11-09 09:58:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-09 09:58:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:42,336 INFO L225 Difference]: With dead ends: 596 [2024-11-09 09:58:42,336 INFO L226 Difference]: Without dead ends: 596 [2024-11-09 09:58:42,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:42,337 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 100 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:42,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 956 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-09 09:58:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 515. [2024-11-09 09:58:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 451 states have (on average 1.4124168514412416) internal successors, (637), 508 states have internal predecessors, (637), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 647 transitions. [2024-11-09 09:58:42,344 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 647 transitions. Word has length 122 [2024-11-09 09:58:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:42,344 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 647 transitions. [2024-11-09 09:58:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 647 transitions. [2024-11-09 09:58:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 09:58:42,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:42,345 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:42,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:42,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 09:58:42,546 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:42,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1821466390, now seen corresponding path program 1 times [2024-11-09 09:58:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145178107] [2024-11-09 09:58:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145178107] [2024-11-09 09:58:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145178107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24286587] [2024-11-09 09:58:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:42,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:42,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 09:58:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:43,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 09:58:43,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:43,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24286587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:43,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-09 09:58:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176798509] [2024-11-09 09:58:43,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 09:58:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 09:58:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:43,502 INFO L87 Difference]: Start difference. First operand 515 states and 647 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:43,582 INFO L93 Difference]: Finished difference Result 518 states and 646 transitions. [2024-11-09 09:58:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:58:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-09 09:58:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:43,584 INFO L225 Difference]: With dead ends: 518 [2024-11-09 09:58:43,584 INFO L226 Difference]: Without dead ends: 518 [2024-11-09 09:58:43,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:43,585 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 227 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:43,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1086 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-09 09:58:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 511. [2024-11-09 09:58:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 447 states have (on average 1.407158836689038) internal successors, (629), 504 states have internal predecessors, (629), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2024-11-09 09:58:43,593 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 122 [2024-11-09 09:58:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:43,593 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2024-11-09 09:58:43,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2024-11-09 09:58:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 09:58:43,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:43,594 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:43,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:43,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 09:58:43,795 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:43,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash -596758811, now seen corresponding path program 1 times [2024-11-09 09:58:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:43,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652195381] [2024-11-09 09:58:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652195381] [2024-11-09 09:58:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652195381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926371769] [2024-11-09 09:58:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:44,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:44,018 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:44,125 INFO L93 Difference]: Finished difference Result 510 states and 637 transitions. [2024-11-09 09:58:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-09 09:58:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:44,127 INFO L225 Difference]: With dead ends: 510 [2024-11-09 09:58:44,127 INFO L226 Difference]: Without dead ends: 510 [2024-11-09 09:58:44,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 09:58:44,128 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:44,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 392 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-09 09:58:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-11-09 09:58:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 447 states have (on average 1.4026845637583893) internal successors, (627), 503 states have internal predecessors, (627), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 637 transitions. [2024-11-09 09:58:44,136 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 637 transitions. Word has length 122 [2024-11-09 09:58:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 637 transitions. [2024-11-09 09:58:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 637 transitions. [2024-11-09 09:58:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 09:58:44,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:44,138 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 09:58:44,138 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash -596758810, now seen corresponding path program 1 times [2024-11-09 09:58:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796547210] [2024-11-09 09:58:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:44,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796547210] [2024-11-09 09:58:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796547210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188157380] [2024-11-09 09:58:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:44,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:44,403 INFO L87 Difference]: Start difference. First operand 510 states and 637 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:44,520 INFO L93 Difference]: Finished difference Result 509 states and 635 transitions. [2024-11-09 09:58:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-09 09:58:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:44,522 INFO L225 Difference]: With dead ends: 509 [2024-11-09 09:58:44,523 INFO L226 Difference]: Without dead ends: 509 [2024-11-09 09:58:44,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 09:58:44,523 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:44,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-09 09:58:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2024-11-09 09:58:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 502 states have internal predecessors, (625), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 635 transitions. [2024-11-09 09:58:44,530 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 635 transitions. Word has length 122 [2024-11-09 09:58:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:44,531 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 635 transitions. [2024-11-09 09:58:44,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 635 transitions. [2024-11-09 09:58:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 09:58:44,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:44,532 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:44,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 09:58:44,532 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1111101113, now seen corresponding path program 1 times [2024-11-09 09:58:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884438806] [2024-11-09 09:58:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884438806] [2024-11-09 09:58:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884438806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571793559] [2024-11-09 09:58:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:45,758 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:45,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 09:58:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:46,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 09:58:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:46,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 09:58:46,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-09 09:58:46,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:46,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:46,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:46,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 09:58:46,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 09:58:46,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 09:58:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:46,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:46,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 09:58:46,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-09 09:58:46,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-09 09:58:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571793559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:47,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2024-11-09 09:58:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138425365] [2024-11-09 09:58:47,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 09:58:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 09:58:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:58:47,006 INFO L87 Difference]: Start difference. First operand 509 states and 635 transitions. Second operand has 21 states, 20 states have (on average 5.0) internal successors, (100), 21 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:47,569 INFO L93 Difference]: Finished difference Result 540 states and 649 transitions. [2024-11-09 09:58:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 09:58:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 21 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-09 09:58:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:47,571 INFO L225 Difference]: With dead ends: 540 [2024-11-09 09:58:47,571 INFO L226 Difference]: Without dead ends: 540 [2024-11-09 09:58:47,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-09 09:58:47,572 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 481 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:47,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 2037 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-09 09:58:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 513. [2024-11-09 09:58:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 451 states have (on average 1.394678492239468) internal successors, (629), 506 states have internal predecessors, (629), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 639 transitions. [2024-11-09 09:58:47,579 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 639 transitions. Word has length 125 [2024-11-09 09:58:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:47,580 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 639 transitions. [2024-11-09 09:58:47,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 21 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 639 transitions. [2024-11-09 09:58:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 09:58:47,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:47,581 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:47,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 09:58:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-09 09:58:47,782 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:47,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1173562013, now seen corresponding path program 1 times [2024-11-09 09:58:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976911662] [2024-11-09 09:58:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:48,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976911662] [2024-11-09 09:58:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976911662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:48,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373371317] [2024-11-09 09:58:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:48,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:48,007 INFO L87 Difference]: Start difference. First operand 513 states and 639 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:48,024 INFO L93 Difference]: Finished difference Result 511 states and 631 transitions. [2024-11-09 09:58:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-09 09:58:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:48,026 INFO L225 Difference]: With dead ends: 511 [2024-11-09 09:58:48,026 INFO L226 Difference]: Without dead ends: 511 [2024-11-09 09:58:48,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 09:58:48,027 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:48,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 686 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-09 09:58:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2024-11-09 09:58:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 443 states have (on average 1.3837471783295712) internal successors, (613), 498 states have internal predecessors, (613), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 623 transitions. [2024-11-09 09:58:48,034 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 623 transitions. Word has length 125 [2024-11-09 09:58:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 623 transitions. [2024-11-09 09:58:48,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 623 transitions. [2024-11-09 09:58:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 09:58:48,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:48,036 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:48,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 09:58:48,036 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1967271444, now seen corresponding path program 1 times [2024-11-09 09:58:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750674173] [2024-11-09 09:58:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:48,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750674173] [2024-11-09 09:58:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750674173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:48,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 09:58:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295151023] [2024-11-09 09:58:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:48,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 09:58:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 09:58:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 09:58:48,368 INFO L87 Difference]: Start difference. First operand 505 states and 623 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:48,481 INFO L93 Difference]: Finished difference Result 523 states and 644 transitions. [2024-11-09 09:58:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:58:48,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2024-11-09 09:58:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:48,483 INFO L225 Difference]: With dead ends: 523 [2024-11-09 09:58:48,483 INFO L226 Difference]: Without dead ends: 523 [2024-11-09 09:58:48,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:48,484 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 15 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:48,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1502 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-09 09:58:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 512. [2024-11-09 09:58:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 450 states have (on average 1.3755555555555556) internal successors, (619), 505 states have internal predecessors, (619), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 09:58:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 629 transitions. [2024-11-09 09:58:48,492 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 629 transitions. Word has length 126 [2024-11-09 09:58:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:48,492 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 629 transitions. [2024-11-09 09:58:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-09 09:58:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 09:58:48,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:48,493 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 09:58:48,494 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1781837507, now seen corresponding path program 1 times [2024-11-09 09:58:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260561722] [2024-11-09 09:58:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 09:58:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260561722] [2024-11-09 09:58:48,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260561722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618184782] [2024-11-09 09:58:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:48,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:48,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:48,973 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:48,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 09:58:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:49,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 09:58:49,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:49,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618184782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:50,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 09:58:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432517968] [2024-11-09 09:58:50,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 09:58:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 09:58:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:58:50,144 INFO L87 Difference]: Start difference. First operand 512 states and 629 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:50,261 INFO L93 Difference]: Finished difference Result 481 states and 545 transitions. [2024-11-09 09:58:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:58:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2024-11-09 09:58:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:50,264 INFO L225 Difference]: With dead ends: 481 [2024-11-09 09:58:50,264 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 09:58:50,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:50,264 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 69 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:50,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1558 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 09:58:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 420. [2024-11-09 09:58:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 360 states have (on average 1.325) internal successors, (477), 415 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 09:58:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 483 transitions. [2024-11-09 09:58:50,271 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 483 transitions. Word has length 127 [2024-11-09 09:58:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:50,273 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 483 transitions. [2024-11-09 09:58:50,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 483 transitions. [2024-11-09 09:58:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 09:58:50,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:50,275 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:50,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 09:58:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:50,476 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 09:58:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -499210225, now seen corresponding path program 1 times [2024-11-09 09:58:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044057519] [2024-11-09 09:58:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms