./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:51:31,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:51:31,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:51:31,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:51:31,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:51:31,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:51:31,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:51:31,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:51:31,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:51:31,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:51:31,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:51:31,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:51:31,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:51:31,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:51:31,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:51:31,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:51:31,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:51:31,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:51:31,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:51:31,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:51:31,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:51:31,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:31,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:51:31,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:51:31,743 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2025-03-08 22:51:31,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:51:31,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:51:31,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:51:31,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:51:31,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:51:31,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-03-08 22:51:33,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b1e3abf/97abbd5c71bb4944858db565bfac905c/FLAGd6d319f92 [2025-03-08 22:51:33,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:51:33,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-03-08 22:51:33,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b1e3abf/97abbd5c71bb4944858db565bfac905c/FLAGd6d319f92 [2025-03-08 22:51:33,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b1e3abf/97abbd5c71bb4944858db565bfac905c [2025-03-08 22:51:33,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:51:33,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:51:33,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:33,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:51:33,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:51:33,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@faf65f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33, skipping insertion in model container [2025-03-08 22:51:33,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:51:33,736 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-08 22:51:33,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:33,757 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:51:33,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:33,825 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:51:33,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33 WrapperNode [2025-03-08 22:51:33,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:33,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:33,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:51:33,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:51:33,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,862 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-03-08 22:51:33,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:33,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:51:33,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:51:33,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:51:33,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,890 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2025-03-08 22:51:33,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:51:33,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:51:33,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:51:33,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:51:33,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (1/1) ... [2025-03-08 22:51:33,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:33,940 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-08 22:51:33,942 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-08 22:51:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-03-08 22:51:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:51:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:51:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:51:34,063 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:51:34,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:51:34,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-03-08 22:51:34,451 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-08 22:51:34,475 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-08 22:51:34,475 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:51:34,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:51:34,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:51:34,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:34 BoogieIcfgContainer [2025-03-08 22:51:34,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:51:34,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:51:34,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:51:34,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:51:34,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:33" (1/3) ... [2025-03-08 22:51:34,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546dcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:34, skipping insertion in model container [2025-03-08 22:51:34,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:33" (2/3) ... [2025-03-08 22:51:34,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546dcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:34, skipping insertion in model container [2025-03-08 22:51:34,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:34" (3/3) ... [2025-03-08 22:51:34,499 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2025-03-08 22:51:34,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:51:34,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test02-2.i that has 2 procedures, 194 locations, 1 initial locations, 5 loop locations, and 92 error locations. [2025-03-08 22:51:34,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:51:34,561 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;@236a15b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:51:34,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-08 22:51:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 98 states have (on average 2.1020408163265305) internal successors, (206), 190 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:34,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:34,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:34,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:34,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 7417886, now seen corresponding path program 1 times [2025-03-08 22:51:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:34,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839337876] [2025-03-08 22:51:34,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:34,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:34,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-08 22:51:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839337876] [2025-03-08 22:51:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839337876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:34,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710290418] [2025-03-08 22:51:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:34,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:34,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:34,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:34,845 INFO L87 Difference]: Start difference. First operand has 194 states, 98 states have (on average 2.1020408163265305) internal successors, (206), 190 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,058 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2025-03-08 22:51:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:51:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,064 INFO L225 Difference]: With dead ends: 188 [2025-03-08 22:51:35,064 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 22:51:35,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:35,070 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 76 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 319 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 22:51:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-08 22:51:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0) internal successors, (194), 182 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-03-08 22:51:35,108 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 4 [2025-03-08 22:51:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,108 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-03-08 22:51:35,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-03-08 22:51:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:35,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:35,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:51:35,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 7417887, now seen corresponding path program 1 times [2025-03-08 22:51:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642422424] [2025-03-08 22:51:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:35,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:35,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,236 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-08 22:51:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642422424] [2025-03-08 22:51:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642422424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290381019] [2025-03-08 22:51:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:35,239 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,471 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2025-03-08 22:51:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:51:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,473 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:51:35,474 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 22:51:35,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:35,475 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 355 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 22:51:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2025-03-08 22:51:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 102 states have (on average 1.9705882352941178) internal successors, (201), 187 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2025-03-08 22:51:35,487 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 4 [2025-03-08 22:51:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,487 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2025-03-08 22:51:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2025-03-08 22:51:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:35,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:35,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:51:35,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 229954638, now seen corresponding path program 1 times [2025-03-08 22:51:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259542189] [2025-03-08 22:51:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,515 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-08 22:51:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259542189] [2025-03-08 22:51:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259542189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811665108] [2025-03-08 22:51:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:35,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:35,516 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,631 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2025-03-08 22:51:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:51:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,632 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:51:35,632 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:51:35,632 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-08 22:51:35,633 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 277 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:51:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-08 22:51:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 102 states have (on average 1.9411764705882353) internal successors, (198), 185 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2025-03-08 22:51:35,639 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 5 [2025-03-08 22:51:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2025-03-08 22:51:35,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2025-03-08 22:51:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:35,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:35,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:51:35,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:35,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 229954639, now seen corresponding path program 1 times [2025-03-08 22:51:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677414782] [2025-03-08 22:51:35,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:35,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,704 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-08 22:51:35,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677414782] [2025-03-08 22:51:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677414782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:35,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623848626] [2025-03-08 22:51:35,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:35,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:35,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:35,705 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:35,808 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-03-08 22:51:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:51:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:35,809 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:51:35,810 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 22:51:35,810 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-08 22:51:35,810 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:35,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 22:51:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-08 22:51:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-03-08 22:51:35,818 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 5 [2025-03-08 22:51:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:35,818 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-03-08 22:51:35,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-03-08 22:51:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:51:35,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:35,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:35,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:51:35,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1258142375, now seen corresponding path program 1 times [2025-03-08 22:51:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897801202] [2025-03-08 22:51:35,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:35,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:51:35,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:51:35,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:35,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:35,940 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-08 22:51:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897801202] [2025-03-08 22:51:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897801202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707090662] [2025-03-08 22:51:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:35,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:35,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:35,942 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,017 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2025-03-08 22:51:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:51:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,019 INFO L225 Difference]: With dead ends: 196 [2025-03-08 22:51:36,019 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:51:36,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:36,020 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 18 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 718 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:51:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2025-03-08 22:51:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2025-03-08 22:51:36,032 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 10 [2025-03-08 22:51:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2025-03-08 22:51:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2025-03-08 22:51:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:51:36,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:36,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:51:36,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2095349624, now seen corresponding path program 1 times [2025-03-08 22:51:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276233661] [2025-03-08 22:51:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:51:36,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:51:36,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,096 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-08 22:51:36,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276233661] [2025-03-08 22:51:36,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276233661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15829967] [2025-03-08 22:51:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:36,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:36,099 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,121 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2025-03-08 22:51:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:51:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,123 INFO L225 Difference]: With dead ends: 268 [2025-03-08 22:51:36,123 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 22:51:36,123 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-08 22:51:36,123 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 84 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 566 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 22:51:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2025-03-08 22:51:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 146 states have (on average 1.917808219178082) internal successors, (280), 227 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-03-08 22:51:36,130 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 12 [2025-03-08 22:51:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,130 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-03-08 22:51:36,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-03-08 22:51:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:36,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:51:36,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -708643630, now seen corresponding path program 1 times [2025-03-08 22:51:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038861495] [2025-03-08 22:51:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:36,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:36,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,204 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-08 22:51:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038861495] [2025-03-08 22:51:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038861495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692613188] [2025-03-08 22:51:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:36,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:36,207 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,311 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2025-03-08 22:51:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:36,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:51:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,313 INFO L225 Difference]: With dead ends: 232 [2025-03-08 22:51:36,313 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 22:51:36,313 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-08 22:51:36,315 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 219 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 22:51:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-03-08 22:51:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 154 states have (on average 1.7662337662337662) internal successors, (272), 223 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2025-03-08 22:51:36,322 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 14 [2025-03-08 22:51:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,323 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2025-03-08 22:51:36,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2025-03-08 22:51:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:36,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:51:36,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash -708643629, now seen corresponding path program 1 times [2025-03-08 22:51:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815435896] [2025-03-08 22:51:36,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:36,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,421 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-08 22:51:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815435896] [2025-03-08 22:51:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815435896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202726781] [2025-03-08 22:51:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:36,425 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,524 INFO L93 Difference]: Finished difference Result 235 states and 272 transitions. [2025-03-08 22:51:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:36,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:51:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,526 INFO L225 Difference]: With dead ends: 235 [2025-03-08 22:51:36,526 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 22:51:36,528 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-08 22:51:36,528 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 22:51:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2025-03-08 22:51:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 164 states have (on average 1.6219512195121952) internal successors, (266), 224 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 270 transitions. [2025-03-08 22:51:36,535 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 270 transitions. Word has length 14 [2025-03-08 22:51:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,536 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 270 transitions. [2025-03-08 22:51:36,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 270 transitions. [2025-03-08 22:51:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:36,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:36,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:51:36,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:36,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash 990459480, now seen corresponding path program 1 times [2025-03-08 22:51:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125447188] [2025-03-08 22:51:36,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:36,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:36,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:36,659 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-08 22:51:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125447188] [2025-03-08 22:51:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125447188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557752709] [2025-03-08 22:51:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:36,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:36,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:36,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:36,662 INFO L87 Difference]: Start difference. First operand 229 states and 270 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:36,838 INFO L93 Difference]: Finished difference Result 282 states and 336 transitions. [2025-03-08 22:51:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:36,840 INFO L225 Difference]: With dead ends: 282 [2025-03-08 22:51:36,840 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 22:51:36,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:36,841 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 24 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:36,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 439 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 22:51:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 237. [2025-03-08 22:51:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 172 states have (on average 1.6162790697674418) internal successors, (278), 232 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 282 transitions. [2025-03-08 22:51:36,848 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 282 transitions. Word has length 19 [2025-03-08 22:51:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:36,849 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 282 transitions. [2025-03-08 22:51:36,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 282 transitions. [2025-03-08 22:51:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:36,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:36,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:36,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:51:36,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash 990459481, now seen corresponding path program 1 times [2025-03-08 22:51:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516896781] [2025-03-08 22:51:36,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:36,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:36,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:36,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:36,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:37,063 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-08 22:51:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516896781] [2025-03-08 22:51:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516896781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:37,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:37,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:37,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160250119] [2025-03-08 22:51:37,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:37,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:37,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:37,064 INFO L87 Difference]: Start difference. First operand 237 states and 282 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:37,238 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2025-03-08 22:51:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:37,239 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:37,239 INFO L225 Difference]: With dead ends: 237 [2025-03-08 22:51:37,239 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 22:51:37,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:37,240 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 4 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:37,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 449 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 22:51:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-08 22:51:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 172 states have (on average 1.5930232558139534) internal successors, (274), 232 states have internal predecessors, (274), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2025-03-08 22:51:37,247 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 19 [2025-03-08 22:51:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:37,247 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2025-03-08 22:51:37,247 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2025-03-08 22:51:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:51:37,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:37,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:37,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:51:37,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:37,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 10489224, now seen corresponding path program 1 times [2025-03-08 22:51:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786141191] [2025-03-08 22:51:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:37,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:37,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:37,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:37,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786141191] [2025-03-08 22:51:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786141191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545338646] [2025-03-08 22:51:37,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:37,455 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-08 22:51:37,457 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-08 22:51:37,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:37,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:51:37,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:37,586 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:51:37,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:51:37,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:51:37,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:37,693 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 42 treesize of output 41 [2025-03-08 22:51:37,720 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 31 treesize of output 13 [2025-03-08 22:51:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:51:37,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:37,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_161 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_161) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2025-03-08 22:51:37,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_161 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_161) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2025-03-08 22:51:37,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:37,788 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 24 treesize of output 25 [2025-03-08 22:51:37,792 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 40 treesize of output 28 [2025-03-08 22:51:37,796 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 9 treesize of output 5 [2025-03-08 22:51:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 22:51:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545338646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:37,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-03-08 22:51:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378833511] [2025-03-08 22:51:37,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:37,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:51:37,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:37,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:51:37,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=99, Unknown=2, NotChecked=42, Total=182 [2025-03-08 22:51:37,822 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:38,113 INFO L93 Difference]: Finished difference Result 240 states and 278 transitions. [2025-03-08 22:51:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:38,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:51:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:38,114 INFO L225 Difference]: With dead ends: 240 [2025-03-08 22:51:38,115 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 22:51:38,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=99, Unknown=2, NotChecked=42, Total=182 [2025-03-08 22:51:38,115 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 44 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:38,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 836 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 482 Invalid, 0 Unknown, 207 Unchecked, 0.3s Time] [2025-03-08 22:51:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 22:51:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2025-03-08 22:51:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5813953488372092) internal successors, (272), 231 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2025-03-08 22:51:38,122 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 24 [2025-03-08 22:51:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2025-03-08 22:51:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2025-03-08 22:51:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:51:38,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:38,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:38,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:38,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 22:51:38,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:38,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash 10489225, now seen corresponding path program 1 times [2025-03-08 22:51:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869937422] [2025-03-08 22:51:38,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:38,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:38,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869937422] [2025-03-08 22:51:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869937422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830039291] [2025-03-08 22:51:38,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:38,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:38,569 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-08 22:51:38,570 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-08 22:51:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:51:38,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:38,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:51:38,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:38,658 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-08 22:51:38,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 22:51:38,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:51:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:51:38,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:38,771 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 62 treesize of output 57 [2025-03-08 22:51:38,779 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 30 treesize of output 13 [2025-03-08 22:51:38,826 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 31 treesize of output 13 [2025-03-08 22:51:38,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-03-08 22:51:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:38,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:38,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-03-08 22:51:38,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-03-08 22:51:38,969 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-03-08 22:51:38,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:38,979 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 24 treesize of output 25 [2025-03-08 22:51:38,982 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 40 treesize of output 28 [2025-03-08 22:51:38,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:38,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-03-08 22:51:39,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:39,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-03-08 22:51:39,003 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:39,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 21 [2025-03-08 22:51:39,007 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-03-08 22:51:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 22:51:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830039291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:39,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-03-08 22:51:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758123332] [2025-03-08 22:51:39,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:51:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:51:39,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2025-03-08 22:51:39,030 INFO L87 Difference]: Start difference. First operand 236 states and 276 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,532 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2025-03-08 22:51:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:51:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:51:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,533 INFO L225 Difference]: With dead ends: 246 [2025-03-08 22:51:39,533 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 22:51:39,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2025-03-08 22:51:39,534 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1342 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 840 Invalid, 0 Unknown, 268 Unchecked, 0.4s Time] [2025-03-08 22:51:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 22:51:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-08 22:51:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.5494505494505495) internal successors, (282), 241 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 286 transitions. [2025-03-08 22:51:39,541 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 286 transitions. Word has length 24 [2025-03-08 22:51:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 286 transitions. [2025-03-08 22:51:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 286 transitions. [2025-03-08 22:51:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:51:39,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,549 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-08 22:51:39,743 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,SelfDestructingSolverStorable11 [2025-03-08 22:51:39,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:39,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2090873945, now seen corresponding path program 2 times [2025-03-08 22:51:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494388054] [2025-03-08 22:51:39,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:51:39,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:39,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:51:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494388054] [2025-03-08 22:51:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494388054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907396877] [2025-03-08 22:51:40,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:40,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:40,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:40,101 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-08 22:51:40,103 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-08 22:51:40,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:51:40,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:40,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:40,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 22:51:40,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:40,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:51:40,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 22:51:40,203 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-08 22:51:40,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:51:40,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:51:40,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:40,317 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 62 treesize of output 57 [2025-03-08 22:51:40,322 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 30 treesize of output 13 [2025-03-08 22:51:40,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:40,411 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 62 treesize of output 57 [2025-03-08 22:51:40,420 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 30 treesize of output 13 [2025-03-08 22:51:40,463 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 31 treesize of output 13 [2025-03-08 22:51:40,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-03-08 22:51:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:40,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:40,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1) 4))))) is different from false [2025-03-08 22:51:40,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2025-03-08 22:51:40,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2025-03-08 22:51:40,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1) v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2025-03-08 22:51:40,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_295))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) .cse1 v_ArrVal_297) c_create_data_~data~0.base) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_295) c_create_data_~data~0.base) .cse2) v_ArrVal_297) c_create_data_~data~0.base) .cse2) .cse3 8)))))) is different from false [2025-03-08 22:51:40,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:40,706 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 46 treesize of output 47 [2025-03-08 22:51:40,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:40,713 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 36 treesize of output 37 [2025-03-08 22:51:40,716 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 64 treesize of output 52 [2025-03-08 22:51:40,719 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 134 treesize of output 116 [2025-03-08 22:51:40,733 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 36 treesize of output 28 [2025-03-08 22:51:40,735 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 13 treesize of output 9 [2025-03-08 22:51:40,737 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 14 treesize of output 10 [2025-03-08 22:51:40,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:40,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-08 22:51:40,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:40,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-03-08 22:51:40,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:40,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 92 treesize of output 56 [2025-03-08 22:51:40,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:40,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-03-08 22:51:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2025-03-08 22:51:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907396877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:40,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-03-08 22:51:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638019261] [2025-03-08 22:51:40,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:40,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 22:51:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:40,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 22:51:40,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=425, Unknown=10, NotChecked=230, Total=756 [2025-03-08 22:51:40,789 INFO L87 Difference]: Start difference. First operand 246 states and 286 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:41,704 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2025-03-08 22:51:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:51:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 22:51:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:41,705 INFO L225 Difference]: With dead ends: 261 [2025-03-08 22:51:41,705 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 22:51:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=786, Unknown=10, NotChecked=320, Total=1332 [2025-03-08 22:51:41,706 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 61 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 24 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:41,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1759 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1204 Invalid, 15 Unknown, 581 Unchecked, 0.7s Time] [2025-03-08 22:51:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 22:51:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-08 22:51:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 186 states have (on average 1.5268817204301075) internal successors, (284), 244 states have internal predecessors, (284), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 288 transitions. [2025-03-08 22:51:41,710 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 288 transitions. Word has length 29 [2025-03-08 22:51:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:41,711 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 288 transitions. [2025-03-08 22:51:41,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 288 transitions. [2025-03-08 22:51:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 22:51:41,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:41,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 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-08 22:51:41,718 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-08 22:51:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:41,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 895279402, now seen corresponding path program 1 times [2025-03-08 22:51:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325681017] [2025-03-08 22:51:41,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:41,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:51:41,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:51:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325681017] [2025-03-08 22:51:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325681017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395219015] [2025-03-08 22:51:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:41,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:41,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:41,982 INFO L87 Difference]: Start difference. First operand 249 states and 288 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:42,048 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2025-03-08 22:51:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 22:51:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:42,050 INFO L225 Difference]: With dead ends: 245 [2025-03-08 22:51:42,050 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 22:51:42,050 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-08 22:51:42,051 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:42,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 240 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 22:51:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-08 22:51:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.4623655913978495) internal successors, (272), 240 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2025-03-08 22:51:42,055 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 43 [2025-03-08 22:51:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:42,056 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2025-03-08 22:51:42,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2025-03-08 22:51:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 22:51:42,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:42,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 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-08 22:51:42,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:51:42,057 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 895279403, now seen corresponding path program 1 times [2025-03-08 22:51:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:42,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871328265] [2025-03-08 22:51:42,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:42,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:42,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:51:42,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:51:42,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:42,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:42,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871328265] [2025-03-08 22:51:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871328265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:42,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32202474] [2025-03-08 22:51:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:42,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:42,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:42,139 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:42,205 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2025-03-08 22:51:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 22:51:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:42,206 INFO L225 Difference]: With dead ends: 241 [2025-03-08 22:51:42,207 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 22:51:42,207 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-08 22:51:42,207 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:42,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 22:51:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-03-08 22:51:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 236 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:51:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2025-03-08 22:51:42,212 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 43 [2025-03-08 22:51:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:42,213 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2025-03-08 22:51:42,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2025-03-08 22:51:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 22:51:42,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:42,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:42,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:51:42,214 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:42,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -479811441, now seen corresponding path program 1 times [2025-03-08 22:51:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510567189] [2025-03-08 22:51:42,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:51:42,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:51:42,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:42,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510567189] [2025-03-08 22:51:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510567189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:42,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:42,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:51:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219961158] [2025-03-08 22:51:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:42,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:51:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:42,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:51:42,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:42,422 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-08 22:51:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:42,699 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2025-03-08 22:51:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-08 22:51:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:42,702 INFO L225 Difference]: With dead ends: 251 [2025-03-08 22:51:42,702 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 22:51:42,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:42,703 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:42,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 492 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 22:51:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2025-03-08 22:51:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 242 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2025-03-08 22:51:42,708 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 46 [2025-03-08 22:51:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:42,708 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2025-03-08 22:51:42,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-08 22:51:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2025-03-08 22:51:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 22:51:42,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:42,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:51:42,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -479811440, now seen corresponding path program 1 times [2025-03-08 22:51:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568277950] [2025-03-08 22:51:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:42,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:51:42,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:51:42,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:42,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568277950] [2025-03-08 22:51:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568277950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:51:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261684563] [2025-03-08 22:51:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:51:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:51:43,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:43,023 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-08 22:51:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:43,373 INFO L93 Difference]: Finished difference Result 261 states and 284 transitions. [2025-03-08 22:51:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:51:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-08 22:51:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:43,374 INFO L225 Difference]: With dead ends: 261 [2025-03-08 22:51:43,374 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 22:51:43,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:43,375 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 51 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 555 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 22:51:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-08 22:51:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 192 states have (on average 1.3854166666666667) internal successors, (266), 242 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 272 transitions. [2025-03-08 22:51:43,379 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 272 transitions. Word has length 46 [2025-03-08 22:51:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 272 transitions. [2025-03-08 22:51:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-08 22:51:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 272 transitions. [2025-03-08 22:51:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 22:51:43,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:43,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:51:43,380 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:43,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1537289332, now seen corresponding path program 1 times [2025-03-08 22:51:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348079635] [2025-03-08 22:51:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:51:43,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:51:43,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348079635] [2025-03-08 22:51:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348079635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:51:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357582308] [2025-03-08 22:51:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:51:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:51:43,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:43,550 INFO L87 Difference]: Start difference. First operand 249 states and 272 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-08 22:51:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:43,821 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2025-03-08 22:51:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-08 22:51:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:43,822 INFO L225 Difference]: With dead ends: 254 [2025-03-08 22:51:43,822 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 22:51:43,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:43,823 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 29 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:43,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 498 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 22:51:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-08 22:51:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 245 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2025-03-08 22:51:43,827 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 48 [2025-03-08 22:51:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:43,827 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2025-03-08 22:51:43,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-08 22:51:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2025-03-08 22:51:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 22:51:43,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:43,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:51:43,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1537289331, now seen corresponding path program 1 times [2025-03-08 22:51:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855924057] [2025-03-08 22:51:43,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:51:43,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:51:43,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855924057] [2025-03-08 22:51:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855924057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158750425] [2025-03-08 22:51:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:44,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:44,189 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-08 22:51:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,545 INFO L93 Difference]: Finished difference Result 256 states and 279 transitions. [2025-03-08 22:51:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:51:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-08 22:51:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,547 INFO L225 Difference]: With dead ends: 256 [2025-03-08 22:51:44,547 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 22:51:44,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:44,547 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:44,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 470 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 22:51:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 251. [2025-03-08 22:51:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 244 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 274 transitions. [2025-03-08 22:51:44,553 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 274 transitions. Word has length 48 [2025-03-08 22:51:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,553 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 274 transitions. [2025-03-08 22:51:44,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-08 22:51:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2025-03-08 22:51:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:51:44,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:51:44,555 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:44,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash 133706441, now seen corresponding path program 1 times [2025-03-08 22:51:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285934496] [2025-03-08 22:51:44,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:51:44,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:51:44,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285934496] [2025-03-08 22:51:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285934496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176691327] [2025-03-08 22:51:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:44,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:44,615 INFO L87 Difference]: Start difference. First operand 251 states and 274 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-08 22:51:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,706 INFO L93 Difference]: Finished difference Result 250 states and 273 transitions. [2025-03-08 22:51:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-08 22:51:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,707 INFO L225 Difference]: With dead ends: 250 [2025-03-08 22:51:44,707 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 22:51:44,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:44,709 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 69 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:44,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 270 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 22:51:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-08 22:51:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 243 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 273 transitions. [2025-03-08 22:51:44,713 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 273 transitions. Word has length 50 [2025-03-08 22:51:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 273 transitions. [2025-03-08 22:51:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-08 22:51:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 273 transitions. [2025-03-08 22:51:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:51:44,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:44,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:51:44,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 133706442, now seen corresponding path program 1 times [2025-03-08 22:51:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144853617] [2025-03-08 22:51:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:51:44,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:51:44,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144853617] [2025-03-08 22:51:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144853617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038896373] [2025-03-08 22:51:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:44,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:44,832 INFO L87 Difference]: Start difference. First operand 250 states and 273 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-08 22:51:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,913 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2025-03-08 22:51:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-08 22:51:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,914 INFO L225 Difference]: With dead ends: 242 [2025-03-08 22:51:44,914 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 22:51:44,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:44,915 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:44,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 230 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 22:51:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-08 22:51:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.3282051282051281) internal successors, (259), 235 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2025-03-08 22:51:44,919 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 50 [2025-03-08 22:51:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,919 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2025-03-08 22:51:44,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-08 22:51:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2025-03-08 22:51:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:51:44,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:44,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:51:44,920 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:44,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -150067485, now seen corresponding path program 1 times [2025-03-08 22:51:44,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232452117] [2025-03-08 22:51:44,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:51:44,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:51:44,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232452117] [2025-03-08 22:51:45,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232452117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636361637] [2025-03-08 22:51:45,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:45,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:45,055 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-08 22:51:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,195 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2025-03-08 22:51:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-08 22:51:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,199 INFO L225 Difference]: With dead ends: 264 [2025-03-08 22:51:45,199 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 22:51:45,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:45,200 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 72 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:45,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 376 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 22:51:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 241. [2025-03-08 22:51:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.323076923076923) internal successors, (258), 234 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2025-03-08 22:51:45,206 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 51 [2025-03-08 22:51:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,206 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2025-03-08 22:51:45,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-08 22:51:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2025-03-08 22:51:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:51:45,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:51:45,207 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:45,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash -150067484, now seen corresponding path program 1 times [2025-03-08 22:51:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27215842] [2025-03-08 22:51:45,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:51:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:51:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27215842] [2025-03-08 22:51:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27215842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236795381] [2025-03-08 22:51:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:45,395 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-08 22:51:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,585 INFO L93 Difference]: Finished difference Result 278 states and 306 transitions. [2025-03-08 22:51:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-08 22:51:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,587 INFO L225 Difference]: With dead ends: 278 [2025-03-08 22:51:45,587 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 22:51:45,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:45,588 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 77 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:45,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 453 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 22:51:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 240. [2025-03-08 22:51:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.317948717948718) internal successors, (257), 233 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2025-03-08 22:51:45,593 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 51 [2025-03-08 22:51:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,594 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2025-03-08 22:51:45,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-08 22:51:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2025-03-08 22:51:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:51:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:51:45,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash -464830466, now seen corresponding path program 1 times [2025-03-08 22:51:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749266316] [2025-03-08 22:51:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:51:45,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:51:45,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749266316] [2025-03-08 22:51:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749266316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867424880] [2025-03-08 22:51:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:45,668 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,800 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2025-03-08 22:51:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:45,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:51:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,802 INFO L225 Difference]: With dead ends: 262 [2025-03-08 22:51:45,802 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 22:51:45,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:45,802 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 44 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:45,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 402 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 22:51:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2025-03-08 22:51:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 195 states have (on average 1.3128205128205128) internal successors, (256), 232 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2025-03-08 22:51:45,808 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 55 [2025-03-08 22:51:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,808 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2025-03-08 22:51:45,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2025-03-08 22:51:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:51:45,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:51:45,809 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -464830465, now seen corresponding path program 1 times [2025-03-08 22:51:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414669600] [2025-03-08 22:51:45,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:51:45,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:51:45,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414669600] [2025-03-08 22:51:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414669600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804759488] [2025-03-08 22:51:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:45,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:45,941 INFO L87 Difference]: Start difference. First operand 239 states and 262 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,062 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2025-03-08 22:51:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:51:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,063 INFO L225 Difference]: With dead ends: 275 [2025-03-08 22:51:46,064 INFO L226 Difference]: Without dead ends: 275 [2025-03-08 22:51:46,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:46,064 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 48 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 414 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-08 22:51:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2025-03-08 22:51:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.3076923076923077) internal successors, (255), 231 states have internal predecessors, (255), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2025-03-08 22:51:46,069 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 55 [2025-03-08 22:51:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2025-03-08 22:51:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2025-03-08 22:51:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:51:46,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:46,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:51:46,070 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1524842429, now seen corresponding path program 1 times [2025-03-08 22:51:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288976932] [2025-03-08 22:51:46,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:46,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288976932] [2025-03-08 22:51:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288976932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851302220] [2025-03-08 22:51:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:46,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:46,454 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,737 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2025-03-08 22:51:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:51:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:51:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,738 INFO L225 Difference]: With dead ends: 292 [2025-03-08 22:51:46,738 INFO L226 Difference]: Without dead ends: 292 [2025-03-08 22:51:46,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:46,739 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 686 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-08 22:51:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 247. [2025-03-08 22:51:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.303921568627451) internal successors, (266), 240 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-03-08 22:51:46,743 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 56 [2025-03-08 22:51:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,743 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-03-08 22:51:46,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-03-08 22:51:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:51:46,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:51:46,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:51:46,744 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:46,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1524842430, now seen corresponding path program 1 times [2025-03-08 22:51:46,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980638827] [2025-03-08 22:51:46,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980638827] [2025-03-08 22:51:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980638827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:51:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647433758] [2025-03-08 22:51:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:46,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:46,961 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:47,250 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-03-08 22:51:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:51:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:51:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:47,251 INFO L225 Difference]: With dead ends: 278 [2025-03-08 22:51:47,251 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 22:51:47,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:47,252 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:47,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 620 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 22:51:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2025-03-08 22:51:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.2990196078431373) internal successors, (265), 240 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2025-03-08 22:51:47,256 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 56 [2025-03-08 22:51:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2025-03-08 22:51:47,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:51:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2025-03-08 22:51:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:51:47,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:47,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:51:47,257 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting create_dataErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2135877985, now seen corresponding path program 1 times [2025-03-08 22:51:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051576155] [2025-03-08 22:51:47,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:47,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:47,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:47,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051576155] [2025-03-08 22:51:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051576155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148508714] [2025-03-08 22:51:47,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:47,352 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-08 22:51:47,356 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-08 22:51:47,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:47,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:51:47,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:47,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:51:47,535 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:51:47,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:51:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:47,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148508714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:47,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-03-08 22:51:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713066504] [2025-03-08 22:51:47,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:47,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:47,565 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:47,672 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2025-03-08 22:51:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 22:51:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:47,673 INFO L225 Difference]: With dead ends: 246 [2025-03-08 22:51:47,673 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 22:51:47,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:47,674 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:47,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 308 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 22:51:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-08 22:51:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 204 states have (on average 1.2892156862745099) internal successors, (263), 239 states have internal predecessors, (263), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2025-03-08 22:51:47,679 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 56 [2025-03-08 22:51:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2025-03-08 22:51:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2025-03-08 22:51:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:51:47,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:47,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:47,688 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-08 22:51:47,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 22:51:47,883 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting create_dataErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2135877986, now seen corresponding path program 1 times [2025-03-08 22:51:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136866963] [2025-03-08 22:51:47,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:47,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:47,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:47,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136866963] [2025-03-08 22:51:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136866963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145862765] [2025-03-08 22:51:48,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:48,040 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-08 22:51:48,041 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-08 22:51:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:51:48,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:51:48,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:51:48,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:48,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:51:48,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:51:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:48,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:51:48,287 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:48,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:51:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:48,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145862765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:48,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-08 22:51:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255900343] [2025-03-08 22:51:48,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:51:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:51:48,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:51:48,500 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,732 INFO L93 Difference]: Finished difference Result 242 states and 261 transitions. [2025-03-08 22:51:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 22:51:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,733 INFO L225 Difference]: With dead ends: 242 [2025-03-08 22:51:48,733 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 22:51:48,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:48,734 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 35 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 538 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 22:51:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 228. [2025-03-08 22:51:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.268421052631579) internal successors, (241), 221 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:51:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2025-03-08 22:51:48,737 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 56 [2025-03-08 22:51:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,737 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2025-03-08 22:51:48,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2025-03-08 22:51:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:51:48,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:48,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:48,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:51:48,939 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-08 22:51:48,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -417183517, now seen corresponding path program 1 times [2025-03-08 22:51:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862516064] [2025-03-08 22:51:48,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:51:48,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:51:48,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:51:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862516064] [2025-03-08 22:51:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862516064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302492301] [2025-03-08 22:51:49,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:49,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:49,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:51:49,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:51:49,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:51:49,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 22:51:49,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:51:50,230 INFO L349 Elim1Store]: treesize reduction 181, result has 16.6 percent of original size [2025-03-08 22:51:50,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 165 [2025-03-08 22:51:51,233 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:51,846 INFO L349 Elim1Store]: treesize reduction 636, result has 10.2 percent of original size [2025-03-08 22:51:51,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 26 case distinctions, treesize of input 90440753 treesize of output 58721421