./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/chgrp-incomplete-1.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 8e036d03abaa2464843bef35227938cb8e4d04c5a12ab6a4a0003d6a8df9a501 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:29:41,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:29:41,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:29:41,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:29:41,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:29:41,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:29:41,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:29:41,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:29:41,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:29:41,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:29:41,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:29:41,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:29:41,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:29:41,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:29:41,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:29:41,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:29:41,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:29:41,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:29:41,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:29:41,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:41,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:29:41,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 8e036d03abaa2464843bef35227938cb8e4d04c5a12ab6a4a0003d6a8df9a501 [2025-03-17 13:29:42,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:29:42,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:29:42,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:29:42,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:29:42,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:29:42,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i [2025-03-17 13:29:43,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed6480d1/08c7349459264d05ac736e31d36a5544/FLAGebbdc7008 [2025-03-17 13:29:43,645 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:29:43,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i [2025-03-17 13:29:43,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed6480d1/08c7349459264d05ac736e31d36a5544/FLAGebbdc7008 [2025-03-17 13:29:43,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed6480d1/08c7349459264d05ac736e31d36a5544 [2025-03-17 13:29:43,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:29:43,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:29:43,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:43,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:29:43,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:29:43,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:43" (1/1) ... [2025-03-17 13:29:43,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d89f267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:43, skipping insertion in model container [2025-03-17 13:29:43,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:43" (1/1) ... [2025-03-17 13:29:43,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:29:44,280 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,284 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,286 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,288 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,288 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,291 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,292 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,304 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,304 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,308 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,317 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:44,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:44,355 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:29:44,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:44,563 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 13:29:44,570 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:29:44,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44 WrapperNode [2025-03-17 13:29:44,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:44,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:44,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:29:44,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:29:44,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,645 INFO L138 Inliner]: procedures = 597, calls = 507, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 805 [2025-03-17 13:29:44,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:44,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:29:44,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:29:44,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:29:44,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,694 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 13:29:44,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:29:44,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:29:44,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:29:44,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:29:44,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (1/1) ... [2025-03-17 13:29:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:44,793 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) [2025-03-17 13:29:44,795 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 [2025-03-17 13:29:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-17 13:29:44,813 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 13:29:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:29:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:29:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 13:29:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 13:29:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 13:29:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 13:29:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:29:44,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:29:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:29:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 13:29:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 13:29:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 13:29:45,092 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:29:45,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:29:46,067 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: havoc xasprintf_#t~mem116#1.base, xasprintf_#t~mem116#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-17 13:29:46,068 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2225: havoc chown_main_#t~nondet75#1; [2025-03-17 13:29:46,115 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2025-03-17 13:29:46,115 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:29:46,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:29:46,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:29:46,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:46 BoogieIcfgContainer [2025-03-17 13:29:46,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:29:46,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:29:46,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:29:46,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:29:46,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:43" (1/3) ... [2025-03-17 13:29:46,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63cf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:46, skipping insertion in model container [2025-03-17 13:29:46,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:44" (2/3) ... [2025-03-17 13:29:46,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63cf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:46, skipping insertion in model container [2025-03-17 13:29:46,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:46" (3/3) ... [2025-03-17 13:29:46,139 INFO L128 eAbstractionObserver]: Analyzing ICFG chgrp-incomplete-1.i [2025-03-17 13:29:46,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:29:46,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chgrp-incomplete-1.i that has 4 procedures, 291 locations, 1 initial locations, 12 loop locations, and 122 error locations. [2025-03-17 13:29:46,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:29:46,190 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;@6faf11bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:29:46,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 122 error locations. [2025-03-17 13:29:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 291 states, 158 states have (on average 1.9873417721518987) internal successors, (314), 281 states have internal predecessors, (314), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 13:29:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:46,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:46,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:46,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:46,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 11839, now seen corresponding path program 1 times [2025-03-17 13:29:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081859994] [2025-03-17 13:29:46,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:46,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:46,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:46,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:46,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081859994] [2025-03-17 13:29:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081859994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:46,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865773147] [2025-03-17 13:29:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:46,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:46,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:46,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:46,881 INFO L87 Difference]: Start difference. First operand has 291 states, 158 states have (on average 1.9873417721518987) internal successors, (314), 281 states have internal predecessors, (314), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:47,000 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2025-03-17 13:29:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:47,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:29:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:47,008 INFO L225 Difference]: With dead ends: 124 [2025-03-17 13:29:47,009 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 13:29:47,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:47,013 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:47,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 13:29:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2025-03-17 13:29:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2025-03-17 13:29:47,045 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 2 [2025-03-17 13:29:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:47,045 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2025-03-17 13:29:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2025-03-17 13:29:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:47,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:47,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:29:47,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash 11840, now seen corresponding path program 1 times [2025-03-17 13:29:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803610668] [2025-03-17 13:29:47,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:47,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:47,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:47,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:47,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:47,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803610668] [2025-03-17 13:29:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803610668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:47,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800446060] [2025-03-17 13:29:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:47,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:47,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:47,433 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:47,509 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2025-03-17 13:29:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:47,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:29:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:47,510 INFO L225 Difference]: With dead ends: 105 [2025-03-17 13:29:47,510 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 13:29:47,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:47,510 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:47,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 13:29:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 13:29:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2025-03-17 13:29:47,520 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 2 [2025-03-17 13:29:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:47,521 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2025-03-17 13:29:47,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2025-03-17 13:29:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:47,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:47,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:29:47,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash 352999312, now seen corresponding path program 1 times [2025-03-17 13:29:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-03-17 13:29:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:47,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:47,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:47,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:47,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-03-17 13:29:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532700246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004115676] [2025-03-17 13:29:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:47,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:47,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:47,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:47,742 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:48,319 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-03-17 13:29:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:29:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:48,323 INFO L225 Difference]: With dead ends: 108 [2025-03-17 13:29:48,323 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 13:29:48,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:48,324 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:48,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:29:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 13:29:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-03-17 13:29:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2025-03-17 13:29:48,330 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 5 [2025-03-17 13:29:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2025-03-17 13:29:48,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2025-03-17 13:29:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:48,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:48,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:48,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:29:48,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 352999473, now seen corresponding path program 1 times [2025-03-17 13:29:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:48,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392654424] [2025-03-17 13:29:48,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:48,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:48,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392654424] [2025-03-17 13:29:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392654424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:48,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209132032] [2025-03-17 13:29:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:48,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:48,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:48,653 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:49,058 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2025-03-17 13:29:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:49,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:29:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:49,059 INFO L225 Difference]: With dead ends: 108 [2025-03-17 13:29:49,061 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 13:29:49,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:49,061 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:49,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 216 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:29:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 13:29:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 13:29:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2025-03-17 13:29:49,069 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 5 [2025-03-17 13:29:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:49,069 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2025-03-17 13:29:49,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2025-03-17 13:29:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:49,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:49,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:49,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:29:49,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:49,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2127628602, now seen corresponding path program 1 times [2025-03-17 13:29:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158080688] [2025-03-17 13:29:49,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:49,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:49,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:49,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:49,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:49,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158080688] [2025-03-17 13:29:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158080688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842593079] [2025-03-17 13:29:49,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:49,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:49,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:49,289 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) [2025-03-17 13:29:49,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:29:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:49,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:49,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:29:49,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:49,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842593079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:49,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:29:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645272490] [2025-03-17 13:29:49,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:49,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:49,720 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:50,487 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2025-03-17 13:29:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:29:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:50,489 INFO L225 Difference]: With dead ends: 115 [2025-03-17 13:29:50,489 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 13:29:50,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:50,489 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:50,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 309 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:29:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 13:29:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 13:29:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 111 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2025-03-17 13:29:50,498 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 8 [2025-03-17 13:29:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2025-03-17 13:29:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2025-03-17 13:29:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:50,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:50,498 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:50,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:29:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:50,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2127628763, now seen corresponding path program 1 times [2025-03-17 13:29:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935479096] [2025-03-17 13:29:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:50,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935479096] [2025-03-17 13:29:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935479096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535015111] [2025-03-17 13:29:50,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:50,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:50,995 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) [2025-03-17 13:29:50,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:29:51,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:51,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:51,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:51,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:51,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:29:51,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:51,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:51,425 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 [2025-03-17 13:29:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535015111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:51,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:29:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069891847] [2025-03-17 13:29:51,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:51,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:29:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:51,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:29:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:29:51,435 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:53,457 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2025-03-17 13:29:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:29:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:29:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:53,458 INFO L225 Difference]: With dead ends: 113 [2025-03-17 13:29:53,458 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 13:29:53,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:29:53,459 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:53,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 339 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:29:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 13:29:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 13:29:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 109 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-17 13:29:53,463 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 8 [2025-03-17 13:29:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:53,463 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-17 13:29:53,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-17 13:29:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:29:53,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:53,463 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:29:53,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 13:29:53,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 13:29:53,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -903555312, now seen corresponding path program 2 times [2025-03-17 13:29:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536910148] [2025-03-17 13:29:53,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:53,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 13:29:53,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-17 13:29:53,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:53,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 13:29:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536910148] [2025-03-17 13:29:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536910148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032129340] [2025-03-17 13:29:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:53,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:53,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:53,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:53,932 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,007 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2025-03-17 13:29:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 13:29:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,010 INFO L225 Difference]: With dead ends: 128 [2025-03-17 13:29:54,010 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 13:29:54,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:54,011 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:54,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 102 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 13:29:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2025-03-17 13:29:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 108 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2025-03-17 13:29:54,019 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 17 [2025-03-17 13:29:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,019 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2025-03-17 13:29:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2025-03-17 13:29:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:29:54,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,020 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:29:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:29:54,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:54,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -903555311, now seen corresponding path program 1 times [2025-03-17 13:29:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770209857] [2025-03-17 13:29:54,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:29:54,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:29:54,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:54,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770209857] [2025-03-17 13:29:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770209857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303363670] [2025-03-17 13:29:54,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:54,283 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) [2025-03-17 13:29:54,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:29:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:29:54,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:29:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:29:54,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:54,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:54,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303363670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:54,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:54,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:29:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353849301] [2025-03-17 13:29:54,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:29:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:29:54,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:29:54,702 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:56,306 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2025-03-17 13:29:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:29:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 17 [2025-03-17 13:29:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:56,307 INFO L225 Difference]: With dead ends: 130 [2025-03-17 13:29:56,307 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 13:29:56,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:29:56,308 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:56,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:29:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 13:29:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 13:29:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 126 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2025-03-17 13:29:56,314 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 17 [2025-03-17 13:29:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2025-03-17 13:29:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2025-03-17 13:29:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 13:29:56,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:56,315 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 13:29:56,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:29:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:56,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 712277585, now seen corresponding path program 2 times [2025-03-17 13:29:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693446246] [2025-03-17 13:29:56,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:56,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 13:29:56,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-17 13:29:56,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:56,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:56,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:56,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693446246] [2025-03-17 13:29:56,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693446246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:56,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334392935] [2025-03-17 13:29:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:56,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:56,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:56,833 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:56,898 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2025-03-17 13:29:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:56,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 13:29:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:56,899 INFO L225 Difference]: With dead ends: 129 [2025-03-17 13:29:56,900 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 13:29:56,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:56,900 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:56,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 216 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 13:29:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 13:29:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 125 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2025-03-17 13:29:56,908 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 35 [2025-03-17 13:29:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:56,909 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2025-03-17 13:29:56,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2025-03-17 13:29:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:29:56,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:56,909 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:29:56,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:56,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1608378404, now seen corresponding path program 1 times [2025-03-17 13:29:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:56,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317901746] [2025-03-17 13:29:56,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:56,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:29:57,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:29:57,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:57,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317901746] [2025-03-17 13:29:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317901746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064481062] [2025-03-17 13:29:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:57,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:57,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:57,260 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-17 13:29:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:57,964 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2025-03-17 13:29:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 43 [2025-03-17 13:29:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:57,965 INFO L225 Difference]: With dead ends: 140 [2025-03-17 13:29:57,965 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 13:29:57,965 INFO L434 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 [2025-03-17 13:29:57,965 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 61 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:57,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:29:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 13:29:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2025-03-17 13:29:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 120 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2025-03-17 13:29:57,968 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 43 [2025-03-17 13:29:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:57,969 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2025-03-17 13:29:57,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-17 13:29:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2025-03-17 13:29:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:29:57,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:57,969 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:57,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:29:57,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1608378405, now seen corresponding path program 1 times [2025-03-17 13:29:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091465658] [2025-03-17 13:29:57,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:58,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:29:58,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:29:58,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:58,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091465658] [2025-03-17 13:29:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091465658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:58,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:29:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359330201] [2025-03-17 13:29:58,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:58,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:58,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:58,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:58,697 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-17 13:29:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:59,469 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2025-03-17 13:29:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2025-03-17 13:29:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:59,470 INFO L225 Difference]: With dead ends: 153 [2025-03-17 13:29:59,470 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 13:29:59,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:59,471 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 96 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 316 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.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:59,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 316 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:29:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 13:29:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2025-03-17 13:29:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 119 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2025-03-17 13:29:59,474 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 43 [2025-03-17 13:29:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2025-03-17 13:29:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-17 13:29:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2025-03-17 13:29:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:29:59,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:59,475 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:59,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:29:59,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:29:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 546167324, now seen corresponding path program 1 times [2025-03-17 13:29:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705328217] [2025-03-17 13:29:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:59,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:29:59,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:29:59,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:59,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705328217] [2025-03-17 13:29:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705328217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:29:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781233967] [2025-03-17 13:29:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:59,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:59,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:59,886 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-17 13:30:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,911 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2025-03-17 13:30:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-03-17 13:30:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,912 INFO L225 Difference]: With dead ends: 157 [2025-03-17 13:30:00,912 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 13:30:00,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:00,913 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 149 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:30:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 13:30:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 136. [2025-03-17 13:30:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 132 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-17 13:30:00,917 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 46 [2025-03-17 13:30:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-17 13:30:00,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-17 13:30:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-17 13:30:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 13:30:00,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:00,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:30:00,920 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:00,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash -248710653, now seen corresponding path program 1 times [2025-03-17 13:30:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:00,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181871371] [2025-03-17 13:30:00,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 13:30:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 13:30:01,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181871371] [2025-03-17 13:30:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181871371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661858256] [2025-03-17 13:30:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:01,205 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-17 13:30:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:02,304 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2025-03-17 13:30:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 47 [2025-03-17 13:30:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:02,305 INFO L225 Difference]: With dead ends: 149 [2025-03-17 13:30:02,306 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 13:30:02,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:02,306 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:02,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 124 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:30:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 13:30:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2025-03-17 13:30:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 129 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-03-17 13:30:02,310 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 47 [2025-03-17 13:30:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-03-17 13:30:02,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-17 13:30:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-03-17 13:30:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 13:30:02,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:02,312 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:02,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:30:02,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -248710652, now seen corresponding path program 1 times [2025-03-17 13:30:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939972373] [2025-03-17 13:30:02,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:02,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 13:30:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 13:30:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:02,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939972373] [2025-03-17 13:30:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939972373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490694496] [2025-03-17 13:30:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:02,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:30:02,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:02,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:30:02,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:02,664 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2025-03-17 13:30:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:03,475 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2025-03-17 13:30:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:03,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2025-03-17 13:30:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:03,476 INFO L225 Difference]: With dead ends: 138 [2025-03-17 13:30:03,476 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 13:30:03,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:03,476 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 79 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:03,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 337 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:30:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 13:30:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-03-17 13:30:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 129 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-03-17 13:30:03,480 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 47 [2025-03-17 13:30:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:03,480 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-03-17 13:30:03,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2025-03-17 13:30:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-03-17 13:30:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:30:03,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:03,482 INFO L218 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] [2025-03-17 13:30:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:30:03,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1534885151, now seen corresponding path program 1 times [2025-03-17 13:30:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903263461] [2025-03-17 13:30:03,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:03,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:30:03,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:30:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903263461] [2025-03-17 13:30:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903263461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232460391] [2025-03-17 13:30:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:03,733 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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) [2025-03-17 13:30:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:04,267 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2025-03-17 13:30:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:04,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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 [2025-03-17 13:30:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:04,268 INFO L225 Difference]: With dead ends: 138 [2025-03-17 13:30:04,268 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 13:30:04,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:04,269 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 51 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:04,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:30:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 13:30:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 13:30:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 133 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-03-17 13:30:04,271 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 49 [2025-03-17 13:30:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:04,271 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-03-17 13:30:04,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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) [2025-03-17 13:30:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-03-17 13:30:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:30:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:04,272 INFO L218 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] [2025-03-17 13:30:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:30:04,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1534885152, now seen corresponding path program 1 times [2025-03-17 13:30:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589519657] [2025-03-17 13:30:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:04,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:30:04,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:30:04,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589519657] [2025-03-17 13:30:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589519657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097737237] [2025-03-17 13:30:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:04,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:04,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:04,955 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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) [2025-03-17 13:30:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:06,520 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2025-03-17 13:30:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 [2025-03-17 13:30:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:06,521 INFO L225 Difference]: With dead ends: 141 [2025-03-17 13:30:06,522 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 13:30:06,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:06,522 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 15 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:06,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 239 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:30:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 13:30:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-17 13:30:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.4134615384615385) internal successors, (147), 133 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2025-03-17 13:30:06,524 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 49 [2025-03-17 13:30:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:06,526 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2025-03-17 13:30:06,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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) [2025-03-17 13:30:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2025-03-17 13:30:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:30:06,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:06,527 INFO L218 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] [2025-03-17 13:30:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:30:06,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1541976181, now seen corresponding path program 1 times [2025-03-17 13:30:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013128033] [2025-03-17 13:30:06,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:06,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:30:06,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:30:06,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:06,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013128033] [2025-03-17 13:30:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013128033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675392164] [2025-03-17 13:30:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:07,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:07,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:07,203 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-17 13:30:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:08,907 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-17 13:30:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-03-17 13:30:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:08,908 INFO L225 Difference]: With dead ends: 136 [2025-03-17 13:30:08,908 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 13:30:08,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:30:08,908 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:08,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 216 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:30:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 13:30:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-17 13:30:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-17 13:30:08,915 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 52 [2025-03-17 13:30:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:08,915 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-17 13:30:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-17 13:30:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-17 13:30:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:30:08,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:08,916 INFO L218 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] [2025-03-17 13:30:08,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:30:08,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:08,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1541976180, now seen corresponding path program 1 times [2025-03-17 13:30:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:08,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396094481] [2025-03-17 13:30:08,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:30:09,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:30:09,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:09,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396094481] [2025-03-17 13:30:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396094481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686232380] [2025-03-17 13:30:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:09,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:09,403 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-17 13:30:10,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:30:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:11,248 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-03-17 13:30:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-03-17 13:30:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:11,249 INFO L225 Difference]: With dead ends: 135 [2025-03-17 13:30:11,249 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 13:30:11,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:30:11,250 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:11,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 237 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 13:30:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 13:30:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-17 13:30:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.375) internal successors, (143), 131 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-03-17 13:30:11,253 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 52 [2025-03-17 13:30:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:11,253 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-03-17 13:30:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-17 13:30:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-03-17 13:30:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 13:30:11,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:11,254 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 13:30:11,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:30:11,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:11,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash -554533144, now seen corresponding path program 1 times [2025-03-17 13:30:11,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:11,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906350028] [2025-03-17 13:30:11,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:11,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 13:30:11,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 13:30:11,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906350028] [2025-03-17 13:30:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906350028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:11,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435577490] [2025-03-17 13:30:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:11,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:11,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:11,448 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-17 13:30:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:12,146 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-17 13:30:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2025-03-17 13:30:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:12,148 INFO L225 Difference]: With dead ends: 147 [2025-03-17 13:30:12,148 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 13:30:12,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:12,148 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:12,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:30:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 13:30:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-03-17 13:30:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 133 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2025-03-17 13:30:12,154 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 56 [2025-03-17 13:30:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2025-03-17 13:30:12,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-17 13:30:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2025-03-17 13:30:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:30:12,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:12,155 INFO L218 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] [2025-03-17 13:30:12,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:30:12,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -10411691, now seen corresponding path program 1 times [2025-03-17 13:30:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512112624] [2025-03-17 13:30:12,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:12,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:30:12,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:30:12,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:12,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512112624] [2025-03-17 13:30:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512112624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 13:30:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906744569] [2025-03-17 13:30:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:12,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 13:30:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:12,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 13:30:12,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 13:30:12,705 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2025-03-17 13:30:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:15,328 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-03-17 13:30:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:30:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 57 [2025-03-17 13:30:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:15,329 INFO L225 Difference]: With dead ends: 151 [2025-03-17 13:30:15,330 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 13:30:15,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:30:15,330 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 119 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:15,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 354 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 13:30:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 13:30:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-03-17 13:30:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.375) internal successors, (154), 139 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2025-03-17 13:30:15,334 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 57 [2025-03-17 13:30:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2025-03-17 13:30:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2025-03-17 13:30:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2025-03-17 13:30:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:30:15,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:15,335 INFO L218 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] [2025-03-17 13:30:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:30:15,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -10411690, now seen corresponding path program 1 times [2025-03-17 13:30:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569374224] [2025-03-17 13:30:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:30:15,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:30:15,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:15,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569374224] [2025-03-17 13:30:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569374224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:30:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185665910] [2025-03-17 13:30:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:30:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:30:16,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:16,319 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-03-17 13:30:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:18,488 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2025-03-17 13:30:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:30:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 57 [2025-03-17 13:30:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:18,489 INFO L225 Difference]: With dead ends: 150 [2025-03-17 13:30:18,489 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 13:30:18,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:30:18,490 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:18,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 213 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:30:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 13:30:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2025-03-17 13:30:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 139 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2025-03-17 13:30:18,493 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 57 [2025-03-17 13:30:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2025-03-17 13:30:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-03-17 13:30:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2025-03-17 13:30:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 13:30:18,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:18,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 13:30:18,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 13:30:18,495 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:18,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1024557042, now seen corresponding path program 1 times [2025-03-17 13:30:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992153828] [2025-03-17 13:30:18,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:30:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:30:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992153828] [2025-03-17 13:30:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992153828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133643741] [2025-03-17 13:30:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:18,694 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) [2025-03-17 13:30:18,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 13:30:19,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:30:19,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:30:19,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:19,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:19,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:30:19,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:19,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:19,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133643741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:19,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:19,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:30:19,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775523172] [2025-03-17 13:30:19,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:19,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:19,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:19,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:19,226 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2025-03-17 13:30:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:20,262 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-03-17 13:30:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-03-17 13:30:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:20,267 INFO L225 Difference]: With dead ends: 172 [2025-03-17 13:30:20,267 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 13:30:20,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:20,268 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:20,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 266 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:30:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 13:30:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2025-03-17 13:30:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 163 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2025-03-17 13:30:20,274 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 61 [2025-03-17 13:30:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:20,274 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2025-03-17 13:30:20,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2025-03-17 13:30:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2025-03-17 13:30:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:30:20,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:20,274 INFO L218 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] [2025-03-17 13:30:20,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 13:30:20,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:20,475 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-17 13:30:20,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1696743819, now seen corresponding path program 1 times [2025-03-17 13:30:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328492780] [2025-03-17 13:30:20,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:20,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:30:20,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:30:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328492780] [2025-03-17 13:30:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328492780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609253530] [2025-03-17 13:30:21,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:21,142 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) [2025-03-17 13:30:21,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 13:30:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:30:21,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:30:21,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:21,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:30:21,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:21,622 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 10 treesize of output 8 [2025-03-17 13:30:21,653 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:30:21,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:30:21,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2025-03-17 13:30:21,734 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 34 treesize of output 27 [2025-03-17 13:30:21,802 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:30:21,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:30:21,869 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:30:21,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:30:21,889 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 37 treesize of output 13 [2025-03-17 13:30:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 13:30:21,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:21,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4538 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem161#1.base| v_ArrVal_4538) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-03-17 13:30:21,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4538 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_4538) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:30:21,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4537 (Array Int Int)) (v_ArrVal_4538 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_4537))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4538)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:30:21,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4537 (Array Int Int)) (v_ArrVal_4538 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4537))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4538)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:30:26,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:26,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-17 13:30:26,084 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 2968 treesize of output 2384 [2025-03-17 13:30:26,111 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 587 treesize of output 503 [2025-03-17 13:30:26,117 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 503 treesize of output 383 [2025-03-17 13:30:26,123 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 383 treesize of output 335 [2025-03-17 13:30:29,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:29,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 265 treesize of output 1903