./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 798a7b37 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-?-798a7b3-m [2025-03-04 09:13:30,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:13:30,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:13:30,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:13:30,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:13:30,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:13:30,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:13:30,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:13:30,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:13:30,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:13:30,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:13:30,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:13:30,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:13:30,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:13:30,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:30,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:13:30,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:13:30,970 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-04 09:13:31,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:13:31,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:13:31,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:13:31,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:13:31,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:13:31,188 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-04 09:13:32,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e442de7/a5d2fc6a8d3a4674b283b6c795e004c6/FLAG0a826e6ca [2025-03-04 09:13:32,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:13:32,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i [2025-03-04 09:13:32,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e442de7/a5d2fc6a8d3a4674b283b6c795e004c6/FLAG0a826e6ca [2025-03-04 09:13:32,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e442de7/a5d2fc6a8d3a4674b283b6c795e004c6 [2025-03-04 09:13:32,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:13:32,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:13:32,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:32,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:13:32,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:13:32,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:32" (1/1) ... [2025-03-04 09:13:32,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6755a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:32, skipping insertion in model container [2025-03-04 09:13:32,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:32" (1/1) ... [2025-03-04 09:13:32,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:13:33,333 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-04 09:13:33,335 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-04 09:13:33,337 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-04 09:13:33,338 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-04 09:13:33,338 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-04 09:13:33,339 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-04 09:13:33,339 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-04 09:13:33,339 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-04 09:13:33,340 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-04 09:13:33,343 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-04 09:13:33,344 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-04 09:13:33,351 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-04 09:13:33,360 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-04 09:13:33,360 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-04 09:13:33,363 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-04 09:13:33,372 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-04 09:13:33,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:33,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:13:33,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:33,606 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:13:33,613 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:13:33,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33 WrapperNode [2025-03-04 09:13:33,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:33,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:33,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:13:33,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:13:33,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,675 INFO L138 Inliner]: procedures = 597, calls = 507, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 805 [2025-03-04 09:13:33,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:33,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:13:33,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:13:33,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:13:33,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,722 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:13:33,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:13:33,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:13:33,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:13:33,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:13:33,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (1/1) ... [2025-03-04 09:13:33,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:33,806 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-04 09:13:33,808 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-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-04 09:13:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:13:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:13:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:13:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:13:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:13:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:13:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:13:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:13:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:13:34,124 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:13:34,125 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:13:35,044 INFO L1325 $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-04 09:13:35,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2225: havoc chown_main_#t~nondet75#1; [2025-03-04 09:13:35,099 INFO L? ?]: Removed 371 outVars from TransFormulas that were not future-live. [2025-03-04 09:13:35,099 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:13:35,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:13:35,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:13:35,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:35 BoogieIcfgContainer [2025-03-04 09:13:35,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:13:35,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:13:35,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:13:35,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:13:35,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:13:32" (1/3) ... [2025-03-04 09:13:35,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2345d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:35, skipping insertion in model container [2025-03-04 09:13:35,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:33" (2/3) ... [2025-03-04 09:13:35,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2345d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:35, skipping insertion in model container [2025-03-04 09:13:35,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:35" (3/3) ... [2025-03-04 09:13:35,128 INFO L128 eAbstractionObserver]: Analyzing ICFG chgrp-incomplete-1.i [2025-03-04 09:13:35,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:13:35,142 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chgrp-incomplete-1.i that has 4 procedures, 299 locations, 1 initial locations, 12 loop locations, and 122 error locations. [2025-03-04 09:13:35,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:13:35,199 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;@7f24ee6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:13:35,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 122 error locations. [2025-03-04 09:13:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 166 states have (on average 1.9397590361445782) internal successors, (322), 289 states have internal predecessors, (322), 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-04 09:13:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:35,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:35,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:35,207 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-04 09:13:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 380286, now seen corresponding path program 1 times [2025-03-04 09:13:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643642131] [2025-03-04 09:13:35,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:35,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:35,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:35,809 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-04 09:13:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643642131] [2025-03-04 09:13:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643642131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165461400] [2025-03-04 09:13:35,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:35,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:35,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:35,843 INFO L87 Difference]: Start difference. First operand has 299 states, 166 states have (on average 1.9397590361445782) internal successors, (322), 289 states have internal predecessors, (322), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:36,423 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2025-03-04 09:13:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:36,432 INFO L225 Difference]: With dead ends: 126 [2025-03-04 09:13:36,432 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 09:13:36,434 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-04 09:13:36,438 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:36,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 93 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:13:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 09:13:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2025-03-04 09:13:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.847457627118644) internal successors, (109), 104 states have internal predecessors, (109), 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-04 09:13:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2025-03-04 09:13:36,477 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 3 [2025-03-04 09:13:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:36,478 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2025-03-04 09:13:36,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2025-03-04 09:13:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:36,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:36,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:36,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:13:36,479 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-04 09:13:36,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 380287, now seen corresponding path program 1 times [2025-03-04 09:13:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:36,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520041250] [2025-03-04 09:13:36,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:36,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:36,824 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-04 09:13:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:36,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520041250] [2025-03-04 09:13:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520041250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:36,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256899825] [2025-03-04 09:13:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:36,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:36,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:36,827 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:37,179 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2025-03-04 09:13:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:37,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:37,180 INFO L225 Difference]: With dead ends: 107 [2025-03-04 09:13:37,180 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 09:13:37,180 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-04 09:13:37,181 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:37,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:13:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 09:13:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 09:13:37,186 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-04 09:13:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2025-03-04 09:13:37,187 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 3 [2025-03-04 09:13:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:37,187 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2025-03-04 09:13:37,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2025-03-04 09:13:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:13:37,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:37,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:13:37,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:13:37,188 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-04 09:13:37,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1555486083, now seen corresponding path program 1 times [2025-03-04 09:13:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420864890] [2025-03-04 09:13:37,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:37,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:13:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:13:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:37,407 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-04 09:13:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420864890] [2025-03-04 09:13:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420864890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148542265] [2025-03-04 09:13:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:37,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:37,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:37,410 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:37,430 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2025-03-04 09:13:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:13:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:37,435 INFO L225 Difference]: With dead ends: 110 [2025-03-04 09:13:37,435 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 09:13:37,435 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-04 09:13:37,436 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:37,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 09:13:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-04 09:13:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 104 states have internal predecessors, (109), 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-04 09:13:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2025-03-04 09:13:37,445 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 6 [2025-03-04 09:13:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2025-03-04 09:13:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2025-03-04 09:13:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:13:37,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:37,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:13:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:13:37,446 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-04 09:13:37,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1555485922, now seen corresponding path program 1 times [2025-03-04 09:13:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503187331] [2025-03-04 09:13:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:37,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:13:37,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:13:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:37,790 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-04 09:13:37,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503187331] [2025-03-04 09:13:37,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503187331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517691421] [2025-03-04 09:13:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:37,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:37,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:37,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:37,793 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:38,558 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2025-03-04 09:13:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:13:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:38,559 INFO L225 Difference]: With dead ends: 110 [2025-03-04 09:13:38,559 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 09:13:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:38,560 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:38,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 162 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:13:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 09:13:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 09:13:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 105 states have internal predecessors, (110), 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-04 09:13:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2025-03-04 09:13:38,563 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 6 [2025-03-04 09:13:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2025-03-04 09:13:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2025-03-04 09:13:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:13:38,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:38,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:38,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:13:38,564 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-04 09:13:38,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:38,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1078664775, now seen corresponding path program 1 times [2025-03-04 09:13:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:38,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847248327] [2025-03-04 09:13:38,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:38,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:38,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:38,779 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-04 09:13:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847248327] [2025-03-04 09:13:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847248327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072826349] [2025-03-04 09:13:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:38,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:38,782 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-04 09:13:38,784 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-04 09:13:38,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:39,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:39,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:13:39,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:39,117 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-04 09:13:39,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:39,139 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-04 09:13:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072826349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:39,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:13:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85986929] [2025-03-04 09:13:39,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:39,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:39,140 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:39,169 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-03-04 09:13:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:13:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:39,170 INFO L225 Difference]: With dead ends: 117 [2025-03-04 09:13:39,170 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 09:13:39,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 09:13:39,171 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:39,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 315 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 09:13:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 09:13:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 113 states have internal predecessors, (120), 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-04 09:13:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2025-03-04 09:13:39,178 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 9 [2025-03-04 09:13:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:39,178 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2025-03-04 09:13:39,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2025-03-04 09:13:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:13:39,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:39,179 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:39,188 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-04 09:13:39,379 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-04 09:13:39,380 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-04 09:13:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1078664614, now seen corresponding path program 1 times [2025-03-04 09:13:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547012794] [2025-03-04 09:13:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:39,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:39,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:39,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:39,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:39,733 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-04 09:13:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547012794] [2025-03-04 09:13:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547012794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535317032] [2025-03-04 09:13:39,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:39,735 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-04 09:13:39,737 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-04 09:13:39,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:40,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:40,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:40,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:40,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:13:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:40,110 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-04 09:13:40,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:40,190 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-04 09:13:40,205 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-04 09:13:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535317032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:40,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:13:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516536255] [2025-03-04 09:13:40,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:13:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:40,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:13:40,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:13:40,206 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:41,302 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2025-03-04 09:13:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:13:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:13:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:41,303 INFO L225 Difference]: With dead ends: 116 [2025-03-04 09:13:41,303 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 09:13:41,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:13:41,304 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 189 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:41,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 392 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:13:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 09:13:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 09:13:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.6956521739130435) internal successors, (117), 112 states have internal predecessors, (117), 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-04 09:13:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2025-03-04 09:13:41,310 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 9 [2025-03-04 09:13:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:41,311 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2025-03-04 09:13:41,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2025-03-04 09:13:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:13:41,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:41,311 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:41,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:13:41,512 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-04 09:13:41,512 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-04 09:13:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1647974269, now seen corresponding path program 2 times [2025-03-04 09:13:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671793426] [2025-03-04 09:13:41,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:41,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:13:41,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 09:13:41,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:41,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:41,812 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-04 09:13:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671793426] [2025-03-04 09:13:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671793426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:41,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:41,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:13:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969718908] [2025-03-04 09:13:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:41,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:41,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:41,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:41,813 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:41,885 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2025-03-04 09:13:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:13:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:41,886 INFO L225 Difference]: With dead ends: 131 [2025-03-04 09:13:41,886 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 09:13:41,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-04 09:13:41,887 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 167 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:41,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 104 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 09:13:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2025-03-04 09:13:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 69 states have (on average 1.681159420289855) internal successors, (116), 111 states have internal predecessors, (116), 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-04 09:13:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-04 09:13:41,891 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 18 [2025-03-04 09:13:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-04 09:13:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-04 09:13:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:13:41,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:41,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:41,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:13:41,892 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-04 09:13:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1647974270, now seen corresponding path program 1 times [2025-03-04 09:13:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48543952] [2025-03-04 09:13:41,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:41,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:13:41,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:13:41,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:41,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:42,113 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-04 09:13:42,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48543952] [2025-03-04 09:13:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48543952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404871400] [2025-03-04 09:13:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:42,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:42,116 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-04 09:13:42,117 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-04 09:13:42,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:13:42,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:13:42,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:42,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:42,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:13:42,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:42,464 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-04 09:13:42,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:42,525 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-04 09:13:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404871400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:42,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:13:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899831403] [2025-03-04 09:13:42,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:13:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:13:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:42,526 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:13:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:42,572 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2025-03-04 09:13:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:13:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-03-04 09:13:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:42,573 INFO L225 Difference]: With dead ends: 133 [2025-03-04 09:13:42,573 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 09:13:42,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-04 09:13:42,573 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:42,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 621 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 09:13:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 09:13:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 129 states have internal predecessors, (134), 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-04 09:13:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2025-03-04 09:13:42,577 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 18 [2025-03-04 09:13:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:42,577 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2025-03-04 09:13:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:13:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2025-03-04 09:13:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:13:42,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:42,577 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:42,586 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-04 09:13:42,778 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-04 09:13:42,778 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-04 09:13:42,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1443894530, now seen corresponding path program 2 times [2025-03-04 09:13:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196307612] [2025-03-04 09:13:42,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:42,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:13:42,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:13:42,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:43,088 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-04 09:13:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:43,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196307612] [2025-03-04 09:13:43,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196307612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:43,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916367224] [2025-03-04 09:13:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:13:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:43,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:13:43,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:43,089 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:43,656 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2025-03-04 09:13:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 09:13:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:43,657 INFO L225 Difference]: With dead ends: 148 [2025-03-04 09:13:43,657 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 09:13:43,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:43,658 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 298 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:43,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 69 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:13:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 09:13:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2025-03-04 09:13:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.528735632183908) internal successors, (133), 128 states have internal predecessors, (133), 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-04 09:13:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2025-03-04 09:13:43,665 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 36 [2025-03-04 09:13:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2025-03-04 09:13:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2025-03-04 09:13:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:13:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:43,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:13:43,666 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-04 09:13:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash -743725345, now seen corresponding path program 1 times [2025-03-04 09:13:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294588479] [2025-03-04 09:13:43,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:13:43,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:13:43,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:44,027 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-04 09:13:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294588479] [2025-03-04 09:13:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294588479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308935619] [2025-03-04 09:13:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:44,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:44,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:44,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:44,030 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-04 09:13:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:44,590 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2025-03-04 09:13:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 44 [2025-03-04 09:13:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:44,591 INFO L225 Difference]: With dead ends: 143 [2025-03-04 09:13:44,591 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 09:13:44,591 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-04 09:13:44,592 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:44,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:13:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 09:13:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2025-03-04 09:13:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.471264367816092) internal successors, (128), 123 states have internal predecessors, (128), 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-04 09:13:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2025-03-04 09:13:44,598 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 44 [2025-03-04 09:13:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:44,599 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2025-03-04 09:13:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-04 09:13:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2025-03-04 09:13:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:13:44,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:44,599 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:44,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:13:44,601 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-04 09:13:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -743725344, now seen corresponding path program 1 times [2025-03-04 09:13:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116171937] [2025-03-04 09:13:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:44,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:13:44,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:13:44,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:44,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:45,286 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-04 09:13:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116171937] [2025-03-04 09:13:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116171937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:13:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712657224] [2025-03-04 09:13:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:45,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:45,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:45,290 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 09:13:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:45,744 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2025-03-04 09:13:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 44 [2025-03-04 09:13:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:45,745 INFO L225 Difference]: With dead ends: 157 [2025-03-04 09:13:45,745 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 09:13:45,745 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-04 09:13:45,746 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:45,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 329 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:13:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 09:13:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 126. [2025-03-04 09:13:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 122 states have internal predecessors, (127), 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-04 09:13:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2025-03-04 09:13:45,749 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 44 [2025-03-04 09:13:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2025-03-04 09:13:45,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-04 09:13:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2025-03-04 09:13:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:13:45,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:45,752 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-04 09:13:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:13:45,752 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-04 09:13:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1414827021, now seen corresponding path program 1 times [2025-03-04 09:13:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:45,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39016064] [2025-03-04 09:13:45,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:45,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:13:45,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:13:45,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:45,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:46,189 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-04 09:13:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39016064] [2025-03-04 09:13:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39016064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:13:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496467973] [2025-03-04 09:13:46,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:46,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:46,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:46,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:46,190 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.6) 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-04 09:13:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:46,291 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2025-03-04 09:13:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:13:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) 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-04 09:13:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:46,292 INFO L225 Difference]: With dead ends: 160 [2025-03-04 09:13:46,292 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 09:13:46,292 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-04 09:13:46,293 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 220 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:46,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 117 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 09:13:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2025-03-04 09:13:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 135 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-04 09:13:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2025-03-04 09:13:46,295 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 47 [2025-03-04 09:13:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2025-03-04 09:13:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) 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-04 09:13:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2025-03-04 09:13:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 09:13:46,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:46,298 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] [2025-03-04 09:13:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:13:46,299 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-04 09:13:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 909936190, now seen corresponding path program 1 times [2025-03-04 09:13:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825382582] [2025-03-04 09:13:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:46,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:13:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:13:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:46,581 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-04 09:13:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825382582] [2025-03-04 09:13:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825382582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841029575] [2025-03-04 09:13:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:46,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:46,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:46,584 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:47,305 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-04 09:13:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 09:13:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:47,306 INFO L225 Difference]: With dead ends: 152 [2025-03-04 09:13:47,307 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 09:13:47,307 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-04 09:13:47,307 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:47,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 129 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:13:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 09:13:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2025-03-04 09:13:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.4356435643564356) 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-04 09:13:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-04 09:13:47,310 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 48 [2025-03-04 09:13:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-04 09:13:47,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-04 09:13:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 09:13:47,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:47,314 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] [2025-03-04 09:13:47,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:13:47,314 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-04 09:13:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash 909936191, now seen corresponding path program 1 times [2025-03-04 09:13:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:47,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713244390] [2025-03-04 09:13:47,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:47,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:13:47,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:13:47,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,674 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-04 09:13:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713244390] [2025-03-04 09:13:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713244390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:47,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:47,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368132108] [2025-03-04 09:13:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:47,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:47,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:47,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:47,676 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:47,728 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2025-03-04 09:13:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 09:13:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:47,729 INFO L225 Difference]: With dead ends: 141 [2025-03-04 09:13:47,729 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 09:13:47,729 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-04 09:13:47,730 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 80 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:47,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 09:13:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2025-03-04 09:13:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 132 states have internal predecessors, (144), 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-04 09:13:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-03-04 09:13:47,735 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 48 [2025-03-04 09:13:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:47,735 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-03-04 09:13:47,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-03-04 09:13:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:13:47,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:47,735 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] [2025-03-04 09:13:47,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:13:47,736 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-04 09:13:47,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1696995302, now seen corresponding path program 1 times [2025-03-04 09:13:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:47,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276482431] [2025-03-04 09:13:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:47,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:13:47,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:13:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:48,018 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-04 09:13:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276482431] [2025-03-04 09:13:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276482431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864408019] [2025-03-04 09:13:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:48,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:48,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:48,019 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 09:13:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:48,515 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-04 09:13:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:48,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-03-04 09:13:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:48,516 INFO L225 Difference]: With dead ends: 141 [2025-03-04 09:13:48,516 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 09:13:48,516 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-04 09:13:48,517 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:48,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 91 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:13:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 09:13:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2025-03-04 09:13:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 136 states have internal predecessors, (151), 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-04 09:13:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2025-03-04 09:13:48,520 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 50 [2025-03-04 09:13:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2025-03-04 09:13:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 09:13:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2025-03-04 09:13:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:13:48,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,520 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] [2025-03-04 09:13:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:13:48,521 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-04 09:13:48,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1696995301, now seen corresponding path program 1 times [2025-03-04 09:13:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073241266] [2025-03-04 09:13:48,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:13:48,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:13:48,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:49,242 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-04 09:13:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073241266] [2025-03-04 09:13:49,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073241266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:49,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:49,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032558763] [2025-03-04 09:13:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:49,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:49,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:49,244 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-04 09:13:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:50,289 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2025-03-04 09:13:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 50 [2025-03-04 09:13:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:50,291 INFO L225 Difference]: With dead ends: 144 [2025-03-04 09:13:50,291 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 09:13:50,291 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-04 09:13:50,291 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 29 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:50,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:13:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 09:13:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-04 09:13:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 136 states have internal predecessors, (150), 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-04 09:13:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2025-03-04 09:13:50,295 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 50 [2025-03-04 09:13:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:50,296 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2025-03-04 09:13:50,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-04 09:13:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2025-03-04 09:13:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:13:50,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:50,297 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] [2025-03-04 09:13:50,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:13:50,297 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-04 09:13:50,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 873287205, now seen corresponding path program 1 times [2025-03-04 09:13:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584098845] [2025-03-04 09:13:50,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:13:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:13:50,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:50,731 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-04 09:13:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584098845] [2025-03-04 09:13:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584098845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606335923] [2025-03-04 09:13:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:50,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:50,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:50,734 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-04 09:13:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:52,613 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2025-03-04 09:13:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:52,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-04 09:13:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:52,614 INFO L225 Difference]: With dead ends: 139 [2025-03-04 09:13:52,614 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 09:13:52,615 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-04 09:13:52,615 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:52,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 238 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:13:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 09:13:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 09:13:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 135 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-04 09:13:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2025-03-04 09:13:52,620 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 53 [2025-03-04 09:13:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:52,620 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2025-03-04 09:13:52,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-04 09:13:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2025-03-04 09:13:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:13:52,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:52,620 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] [2025-03-04 09:13:52,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:13:52,621 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 119 more)] === [2025-03-04 09:13:52,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash 873287206, now seen corresponding path program 1 times [2025-03-04 09:13:52,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:52,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872232447] [2025-03-04 09:13:52,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:52,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:13:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:13:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:53,264 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-04 09:13:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872232447] [2025-03-04 09:13:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872232447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:53,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:53,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674031497] [2025-03-04 09:13:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:53,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:53,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:53,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:53,265 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-04 09:13:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:54,308 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-03-04 09:13:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-04 09:13:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:54,309 INFO L225 Difference]: With dead ends: 138 [2025-03-04 09:13:54,310 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 09:13:54,310 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-04 09:13:54,310 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:54,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:13:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 09:13:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 09:13:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 134 states have internal predecessors, (146), 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-04 09:13:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2025-03-04 09:13:54,313 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 53 [2025-03-04 09:13:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:54,313 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2025-03-04 09:13:54,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-04 09:13:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2025-03-04 09:13:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:13:54,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:54,313 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] [2025-03-04 09:13:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:13:54,314 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-04 09:13:54,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1287356647, now seen corresponding path program 1 times [2025-03-04 09:13:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926311635] [2025-03-04 09:13:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:13:54,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:13:54,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:54,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:54,470 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-04 09:13:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926311635] [2025-03-04 09:13:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926311635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:54,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141043618] [2025-03-04 09:13:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:54,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:54,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:54,472 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-04 09:13:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:54,483 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2025-03-04 09:13:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:54,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-04 09:13:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:54,485 INFO L225 Difference]: With dead ends: 150 [2025-03-04 09:13:54,485 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 09:13:54,485 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-04 09:13:54,486 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 179 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:54,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 179 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 09:13:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2025-03-04 09:13:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 136 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-04 09:13:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2025-03-04 09:13:54,492 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 57 [2025-03-04 09:13:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:54,492 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2025-03-04 09:13:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-04 09:13:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2025-03-04 09:13:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:13:54,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:54,492 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, 1] [2025-03-04 09:13:54,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:13:54,492 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-04 09:13:54,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1253103792, now seen corresponding path program 1 times [2025-03-04 09:13:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583155339] [2025-03-04 09:13:54,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:13:54,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:13:54,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:54,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:55,162 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-04 09:13:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583155339] [2025-03-04 09:13:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583155339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:13:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654013462] [2025-03-04 09:13:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:55,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:13:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:13:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:13:55,165 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-04 09:13:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:56,965 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-03-04 09:13:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:13:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 58 [2025-03-04 09:13:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:56,966 INFO L225 Difference]: With dead ends: 154 [2025-03-04 09:13:56,966 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 09:13:56,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:13:56,967 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 118 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:56,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 334 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:13:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 09:13:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-03-04 09:13:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 142 states have internal predecessors, (157), 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-04 09:13:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2025-03-04 09:13:56,970 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 58 [2025-03-04 09:13:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2025-03-04 09:13:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-04 09:13:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2025-03-04 09:13:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:13:56,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:56,970 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, 1] [2025-03-04 09:13:56,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:13:56,971 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-04 09:13:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1253103791, now seen corresponding path program 1 times [2025-03-04 09:13:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966370200] [2025-03-04 09:13:56,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:13:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:13:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:57,787 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-04 09:13:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966370200] [2025-03-04 09:13:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966370200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:13:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948517419] [2025-03-04 09:13:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:57,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:13:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:57,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:13:57,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:13:57,788 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-04 09:14:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:00,455 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2025-03-04 09:14:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:14:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 58 [2025-03-04 09:14:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:00,456 INFO L225 Difference]: With dead ends: 153 [2025-03-04 09:14:00,457 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 09:14:00,457 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-04 09:14:00,458 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 126 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:00,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 337 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 09:14:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 09:14:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2025-03-04 09:14:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3596491228070176) internal successors, (155), 142 states have internal predecessors, (155), 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-04 09:14:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2025-03-04 09:14:00,464 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 58 [2025-03-04 09:14:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2025-03-04 09:14:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-04 09:14:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2025-03-04 09:14:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 09:14:00,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:00,464 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, 1] [2025-03-04 09:14:00,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:14:00,464 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-04 09:14:00,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1605651603, now seen corresponding path program 1 times [2025-03-04 09:14:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807453371] [2025-03-04 09:14:00,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:14:00,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:14:00,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:00,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:00,653 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-04 09:14:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807453371] [2025-03-04 09:14:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807453371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923047145] [2025-03-04 09:14:00,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:00,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:00,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:00,655 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-04 09:14:00,656 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-04 09:14:00,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:14:01,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:14:01,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:01,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:01,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:14:01,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:01,100 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-04 09:14:01,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:01,130 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-04 09:14:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923047145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:01,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:01,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:14:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897794965] [2025-03-04 09:14:01,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:01,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:14:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:01,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:14:01,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:14:01,131 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:01,161 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2025-03-04 09:14:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:14:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-04 09:14:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:01,163 INFO L225 Difference]: With dead ends: 175 [2025-03-04 09:14:01,163 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 09:14:01,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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-04 09:14:01,166 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:01,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 443 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 09:14:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-03-04 09:14:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 166 states have internal predecessors, (189), 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-04 09:14:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2025-03-04 09:14:01,171 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 62 [2025-03-04 09:14:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:01,171 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2025-03-04 09:14:01,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2025-03-04 09:14:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:14:01,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:01,172 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, 1] [2025-03-04 09:14:01,182 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-04 09:14:01,372 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-04 09:14:01,372 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-04 09:14:01,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1764654460, now seen corresponding path program 1 times [2025-03-04 09:14:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030426851] [2025-03-04 09:14:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:01,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:01,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:01,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:01,978 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-04 09:14:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030426851] [2025-03-04 09:14:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030426851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871853905] [2025-03-04 09:14:01,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:01,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:01,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:01,980 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-04 09:14:01,982 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-04 09:14:02,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:02,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:02,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:02,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:02,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:14:02,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:02,427 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-04 09:14:02,450 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:14:02,451 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-04 09:14:02,481 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-04 09:14:02,529 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-04 09:14:02,585 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:02,586 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-04 09:14:02,636 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:02,636 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-04 09:14:02,653 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-04 09:14:02,697 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-04 09:14:02,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:02,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4536 (Array Int Int)) (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4536))) (store .cse2 (select (select .cse2 |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-04 09:14:02,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:02,938 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-04 09:14:02,944 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-04 09:14:02,989 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-04 09:14:03,000 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-04 09:14:03,005 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-04 09:14:06,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:06,165 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