./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:22:11,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:22:11,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:22:11,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:22:11,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:22:11,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:22:11,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:22:11,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:22:11,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:22:11,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:22:11,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:22:11,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:22:11,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:22:11,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:22:11,338 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:22:11,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:22:11,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:22:11,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:11,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:11,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:11,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:22:11,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:22:11,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:22:11,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:22:11,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:22:11,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:22:11,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2025-01-09 22:22:11,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:22:11,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:22:11,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:22:11,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:22:11,583 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:22:11,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-01-09 22:22:12,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4b4bdbef/cd7451b74d7a4baaa1b65fab43f2532d/FLAGb2af931f8 [2025-01-09 22:22:13,167 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:22:13,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-01-09 22:22:13,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4b4bdbef/cd7451b74d7a4baaa1b65fab43f2532d/FLAGb2af931f8 [2025-01-09 22:22:13,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4b4bdbef/cd7451b74d7a4baaa1b65fab43f2532d [2025-01-09 22:22:13,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:22:13,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:22:13,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:13,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:22:13,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:22:13,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5861885e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13, skipping insertion in model container [2025-01-09 22:22:13,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:22:13,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:22:13,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:13,430 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:22:13,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:13,475 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:22:13,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13 WrapperNode [2025-01-09 22:22:13,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:13,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:13,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:22:13,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:22:13,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,500 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-01-09 22:22:13,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:13,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:22:13,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:22:13,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:22:13,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,530 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-01-09 22:22:13,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:22:13,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:22:13,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:22:13,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:22:13,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (1/1) ... [2025-01-09 22:22:13,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:13,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:22:13,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:22:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-01-09 22:22:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:22:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:22:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:22:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:22:13,705 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:22:13,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:22:14,059 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-01-09 22:22:14,060 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:22:14,076 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:22:14,076 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 22:22:14,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:14 BoogieIcfgContainer [2025-01-09 22:22:14,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:22:14,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:22:14,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:22:14,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:22:14,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:22:13" (1/3) ... [2025-01-09 22:22:14,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c251f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:14, skipping insertion in model container [2025-01-09 22:22:14,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:13" (2/3) ... [2025-01-09 22:22:14,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c251f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:14, skipping insertion in model container [2025-01-09 22:22:14,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:14" (3/3) ... [2025-01-09 22:22:14,087 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2025-01-09 22:22:14,100 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:22:14,102 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-01-09 22:22:14,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:22:14,154 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;@401eb5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:22:14,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-01-09 22:22:14,159 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-01-09 22:22:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:14,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:14,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:14,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:14,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 4960744, now seen corresponding path program 1 times [2025-01-09 22:22:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744203954] [2025-01-09 22:22:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744203954] [2025-01-09 22:22:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744203954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:14,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126642207] [2025-01-09 22:22:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:14,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:22:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:22:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:22:14,315 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-01-09 22:22:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:14,337 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2025-01-09 22:22:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:22:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-01-09 22:22:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:14,343 INFO L225 Difference]: With dead ends: 194 [2025-01-09 22:22:14,343 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 22:22:14,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:22:14,347 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:14,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 22:22:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-09 22:22:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 97 states have (on average 2.0618556701030926) internal successors, (200), 188 states have internal predecessors, (200), 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-01-09 22:22:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2025-01-09 22:22:14,386 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 4 [2025-01-09 22:22:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:14,386 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2025-01-09 22:22:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-01-09 22:22:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2025-01-09 22:22:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:14,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:14,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:14,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:22:14,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2025-01-09 22:22:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228350021] [2025-01-09 22:22:14,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:14,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:14,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228350021] [2025-01-09 22:22:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228350021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:14,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:14,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188293581] [2025-01-09 22:22:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:14,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:14,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:14,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:14,531 INFO L87 Difference]: Start difference. First operand 192 states and 204 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-01-09 22:22:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:14,745 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-01-09 22:22:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:14,745 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-01-09 22:22:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:14,746 INFO L225 Difference]: With dead ends: 186 [2025-01-09 22:22:14,746 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 22:22:14,746 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-01-09 22:22:14,747 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 76 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:14,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 315 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 22:22:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-09 22:22:14,752 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-01-09 22:22:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-01-09 22:22:14,753 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 4 [2025-01-09 22:22:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:14,754 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-01-09 22:22:14,754 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-01-09 22:22:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-01-09 22:22:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:14,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:14,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:14,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:22:14,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:14,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2025-01-09 22:22:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545728465] [2025-01-09 22:22:14,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:14,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545728465] [2025-01-09 22:22:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545728465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88905096] [2025-01-09 22:22:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:14,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:14,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:14,858 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-01-09 22:22:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,056 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2025-01-09 22:22:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:15,056 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-01-09 22:22:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,058 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:22:15,058 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:22:15,058 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-01-09 22:22:15,059 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-09 22:22:15,059 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-01-09 22:22:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:22:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2025-01-09 22:22:15,064 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-01-09 22:22:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2025-01-09 22:22:15,065 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 4 [2025-01-09 22:22:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2025-01-09 22:22:15,066 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-01-09 22:22:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2025-01-09 22:22:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:15,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:22:15,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2025-01-09 22:22:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588646166] [2025-01-09 22:22:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:15,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588646166] [2025-01-09 22:22:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588646166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:15,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546088475] [2025-01-09 22:22:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:15,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:15,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:15,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:15,099 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-01-09 22:22:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,224 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2025-01-09 22:22:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:15,225 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-01-09 22:22:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,226 INFO L225 Difference]: With dead ends: 189 [2025-01-09 22:22:15,226 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 22:22:15,226 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-01-09 22:22:15,227 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-01-09 22:22:15,228 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-01-09 22:22:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 22:22:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-01-09 22:22:15,236 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-01-09 22:22:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2025-01-09 22:22:15,238 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 5 [2025-01-09 22:22:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,238 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2025-01-09 22:22:15,239 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-01-09 22:22:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2025-01-09 22:22:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:15,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:15,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:22:15,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2025-01-09 22:22:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398355048] [2025-01-09 22:22:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:15,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398355048] [2025-01-09 22:22:15,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398355048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:15,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408030143] [2025-01-09 22:22:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:15,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:15,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:15,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:15,279 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-01-09 22:22:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,373 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-01-09 22:22:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:15,373 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-01-09 22:22:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,374 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:22:15,374 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 22:22:15,374 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-01-09 22:22:15,375 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-01-09 22:22:15,375 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-01-09 22:22:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 22:22:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-01-09 22:22:15,379 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-01-09 22:22:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-01-09 22:22:15,380 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 5 [2025-01-09 22:22:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-01-09 22:22:15,380 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-01-09 22:22:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-01-09 22:22:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:22:15,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:15,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:22:15,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2025-01-09 22:22:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926298419] [2025-01-09 22:22:15,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:22:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:22:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926298419] [2025-01-09 22:22:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926298419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33333975] [2025-01-09 22:22:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:15,525 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-01-09 22:22:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,611 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2025-01-09 22:22:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:15,612 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-01-09 22:22:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,613 INFO L225 Difference]: With dead ends: 196 [2025-01-09 22:22:15,613 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 22:22:15,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:15,615 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:15,615 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.1s Time] [2025-01-09 22:22:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 22:22:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2025-01-09 22:22:15,624 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-01-09 22:22:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2025-01-09 22:22:15,626 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 10 [2025-01-09 22:22:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,630 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2025-01-09 22:22:15,630 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-01-09 22:22:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2025-01-09 22:22:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:22:15,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:22:15,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash -635284807, now seen corresponding path program 1 times [2025-01-09 22:22:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817196947] [2025-01-09 22:22:15,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:22:15,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:22:15,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817196947] [2025-01-09 22:22:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817196947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:15,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:15,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227761461] [2025-01-09 22:22:15,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:15,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:15,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:15,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:15,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:15,735 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-01-09 22:22:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,777 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2025-01-09 22:22:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:15,777 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-01-09 22:22:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,778 INFO L225 Difference]: With dead ends: 268 [2025-01-09 22:22:15,778 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 22:22:15,779 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-01-09 22:22:15,779 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-01-09 22:22:15,779 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-01-09 22:22:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 22:22:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2025-01-09 22:22:15,784 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-01-09 22:22:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-01-09 22:22:15,785 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 12 [2025-01-09 22:22:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-01-09 22:22:15,786 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-01-09 22:22:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-01-09 22:22:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:22:15,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:22:15,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1781013652, now seen corresponding path program 1 times [2025-01-09 22:22:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946860290] [2025-01-09 22:22:15,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:22:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:22:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946860290] [2025-01-09 22:22:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946860290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965582227] [2025-01-09 22:22:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:15,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:15,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:15,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:15,870 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:22:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,971 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2025-01-09 22:22:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2025-01-09 22:22:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,972 INFO L225 Difference]: With dead ends: 234 [2025-01-09 22:22:15,973 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 22:22:15,973 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-01-09 22:22:15,973 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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-01-09 22:22:15,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 219 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 22:22:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2025-01-09 22:22:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 225 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-01-09 22:22:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 278 transitions. [2025-01-09 22:22:15,979 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 278 transitions. Word has length 13 [2025-01-09 22:22:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 278 transitions. [2025-01-09 22:22:15,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:22:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 278 transitions. [2025-01-09 22:22:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:22:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:15,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:22:15,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1781013653, now seen corresponding path program 1 times [2025-01-09 22:22:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244081304] [2025-01-09 22:22:15,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:22:15,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:22:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244081304] [2025-01-09 22:22:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244081304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325711334] [2025-01-09 22:22:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:16,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:16,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:16,073 INFO L87 Difference]: Start difference. First operand 230 states and 278 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:22:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:16,176 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2025-01-09 22:22:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2025-01-09 22:22:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:16,178 INFO L225 Difference]: With dead ends: 237 [2025-01-09 22:22:16,178 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 22:22:16,178 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-01-09 22:22:16,178 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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-01-09 22:22:16,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 22:22:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2025-01-09 22:22:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 166 states have (on average 1.6144578313253013) internal successors, (268), 226 states have internal predecessors, (268), 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-01-09 22:22:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2025-01-09 22:22:16,185 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 13 [2025-01-09 22:22:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:16,185 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2025-01-09 22:22:16,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 22:22:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2025-01-09 22:22:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:16,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:16,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:16,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:22:16,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:16,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1923352358, now seen corresponding path program 1 times [2025-01-09 22:22:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599804386] [2025-01-09 22:22:16,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:16,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:16,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:16,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:16,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599804386] [2025-01-09 22:22:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599804386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138620560] [2025-01-09 22:22:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:16,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:16,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:16,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:16,314 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-01-09 22:22:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:16,553 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2025-01-09 22:22:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2025-01-09 22:22:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:16,555 INFO L225 Difference]: With dead ends: 286 [2025-01-09 22:22:16,555 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 22:22:16,555 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-01-09 22:22:16,555 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 25 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 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-01-09 22:22:16,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 439 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 22:22:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 239. [2025-01-09 22:22:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 234 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-01-09 22:22:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2025-01-09 22:22:16,565 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 18 [2025-01-09 22:22:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2025-01-09 22:22:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-01-09 22:22:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2025-01-09 22:22:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:16,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:16,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:22:16,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:16,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1923352359, now seen corresponding path program 1 times [2025-01-09 22:22:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017880845] [2025-01-09 22:22:16,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:16,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:16,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:16,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:16,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:16,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017880845] [2025-01-09 22:22:16,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017880845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:16,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:16,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648013339] [2025-01-09 22:22:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:16,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:16,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:16,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:16,734 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:16,917 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2025-01-09 22:22:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:22:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:16,919 INFO L225 Difference]: With dead ends: 239 [2025-01-09 22:22:16,919 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 22:22:16,920 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-01-09 22:22:16,920 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-01-09 22:22:16,920 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-01-09 22:22:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 22:22:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-01-09 22:22:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.5862068965517242) internal successors, (276), 234 states have internal predecessors, (276), 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-01-09 22:22:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 280 transitions. [2025-01-09 22:22:16,927 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 280 transitions. Word has length 18 [2025-01-09 22:22:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:16,927 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 280 transitions. [2025-01-09 22:22:16,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 280 transitions. [2025-01-09 22:22:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:16,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:16,928 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] [2025-01-09 22:22:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:22:16,928 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -958987808, now seen corresponding path program 1 times [2025-01-09 22:22:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985477014] [2025-01-09 22:22:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:16,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:16,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:16,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:16,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985477014] [2025-01-09 22:22:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985477014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743491536] [2025-01-09 22:22:17,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:17,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:17,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:22:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:17,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:17,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:22:17,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:17,314 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:22:17,316 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-01-09 22:22:17,344 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-01-09 22:22:17,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:17,415 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-01-09 22:22:17,436 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-01-09 22:22:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:22:17,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:17,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_162) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2025-01-09 22:22:17,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:17,513 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-01-09 22:22:17,515 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-01-09 22:22:17,521 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-01-09 22:22:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:22:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743491536] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:17,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-01-09 22:22:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610490929] [2025-01-09 22:22:17,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:17,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:22:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:17,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:22:17,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=111, Unknown=7, NotChecked=22, Total=182 [2025-01-09 22:22:17,540 INFO L87 Difference]: Start difference. First operand 239 states and 280 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-01-09 22:22:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:17,889 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2025-01-09 22:22:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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 23 [2025-01-09 22:22:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:17,891 INFO L225 Difference]: With dead ends: 242 [2025-01-09 22:22:17,891 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 22:22:17,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=111, Unknown=7, NotChecked=22, Total=182 [2025-01-09 22:22:17,891 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 46 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:17,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 926 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 633 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2025-01-09 22:22:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 22:22:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2025-01-09 22:22:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 174 states have (on average 1.5747126436781609) internal successors, (274), 233 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-01-09 22:22:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 278 transitions. [2025-01-09 22:22:17,895 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 278 transitions. Word has length 23 [2025-01-09 22:22:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:17,895 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 278 transitions. [2025-01-09 22:22:17,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-01-09 22:22:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 278 transitions. [2025-01-09 22:22:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:17,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:17,896 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] [2025-01-09 22:22:17,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:22:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:22:18,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:18,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -958987807, now seen corresponding path program 1 times [2025-01-09 22:22:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056503555] [2025-01-09 22:22:18,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:18,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:18,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:18,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:18,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056503555] [2025-01-09 22:22:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056503555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:18,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641998148] [2025-01-09 22:22:18,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:18,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:18,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:18,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:18,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:22:18,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:18,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:18,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:18,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:18,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:22:18,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:18,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:22:18,432 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-01-09 22:22:18,448 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-01-09 22:22:18,454 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-01-09 22:22:18,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:18,549 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-01-09 22:22:18,552 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-01-09 22:22:18,594 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-01-09 22:22:18,598 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-01-09 22:22:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:18,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:18,691 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-01-09 22:22:18,704 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-01-09 22:22:18,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:18,748 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-01-09 22:22:18,751 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-01-09 22:22:18,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:18,768 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-01-09 22:22:18,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:18,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 22:22:18,778 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:18,780 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-01-09 22:22:18,782 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:18,784 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-01-09 22:22:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:22:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641998148] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:18,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-01-09 22:22:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910352747] [2025-01-09 22:22:18,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:22:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:18,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:22:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=306, Unknown=5, NotChecked=74, Total=462 [2025-01-09 22:22:18,816 INFO L87 Difference]: Start difference. First operand 238 states and 278 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-01-09 22:22:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:19,648 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2025-01-09 22:22:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:22:19,649 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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 23 [2025-01-09 22:22:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:19,649 INFO L225 Difference]: With dead ends: 248 [2025-01-09 22:22:19,650 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 22:22:19,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=397, Unknown=5, NotChecked=86, Total=600 [2025-01-09 22:22:19,650 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 12 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:19,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 808 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 180 Unchecked, 0.7s Time] [2025-01-09 22:22:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 22:22:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-01-09 22:22:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 184 states have (on average 1.5434782608695652) internal successors, (284), 243 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-01-09 22:22:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2025-01-09 22:22:19,658 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 23 [2025-01-09 22:22:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2025-01-09 22:22:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-01-09 22:22:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2025-01-09 22:22:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:19,660 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] [2025-01-09 22:22:19,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:19,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:19,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash 450210663, now seen corresponding path program 2 times [2025-01-09 22:22:19,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:19,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232323979] [2025-01-09 22:22:19,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:19,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 22:22:19,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:19,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:19,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:22:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232323979] [2025-01-09 22:22:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232323979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500439793] [2025-01-09 22:22:20,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:20,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:20,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:20,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:20,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:22:20,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 22:22:20,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:20,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:20,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:22:20,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:20,336 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-01-09 22:22:20,345 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-01-09 22:22:20,363 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-01-09 22:22:20,366 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-01-09 22:22:20,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:20,457 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-01-09 22:22:20,462 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-01-09 22:22:20,555 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:20,555 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-01-09 22:22:20,564 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-01-09 22:22:20,611 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-01-09 22:22:20,616 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-01-09 22:22:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:20,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:20,783 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_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-01-09 22:22:20,797 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_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8)))))) is different from false [2025-01-09 22:22:20,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_293))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (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_293) c_create_data_~data~0.base) .cse2) v_ArrVal_295) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2025-01-09 22:22:20,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (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_293) c_create_data_~data~0.base) .cse1) v_ArrVal_295) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) .cse3 v_ArrVal_295) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_296) c_create_data_~data~0.base) .cse1))))))))) is different from false [2025-01-09 22:22:20,841 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_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (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_293) c_create_data_~data~0.base) .cse1) v_ArrVal_295) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_294) .cse2 v_ArrVal_295) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_296) c_create_data_~data~0.base) .cse1))))))))) is different from false [2025-01-09 22:22:20,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:20,849 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 89 treesize of output 90 [2025-01-09 22:22:20,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:20,857 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 79 treesize of output 60 [2025-01-09 22:22:20,864 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 754 treesize of output 640 [2025-01-09 22:22:20,874 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 415 treesize of output 385 [2025-01-09 22:22:20,882 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 132 treesize of output 104 [2025-01-09 22:22:20,889 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 104 treesize of output 96 [2025-01-09 22:22:20,894 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 77 treesize of output 73 [2025-01-09 22:22:20,897 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 92 treesize of output 80 [2025-01-09 22:22:20,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:20,917 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 46 treesize of output 47 [2025-01-09 22:22:20,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:20,922 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 36 treesize of output 37 [2025-01-09 22:22:20,925 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:20,927 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 34 treesize of output 22 [2025-01-09 22:22:20,930 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:20,931 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 22 treesize of output 10 [2025-01-09 22:22:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-01-09 22:22:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500439793] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:20,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-01-09 22:22:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055473013] [2025-01-09 22:22:20,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:20,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:22:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:20,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:22:20,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=426, Unknown=15, NotChecked=230, Total=756 [2025-01-09 22:22:20,958 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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-01-09 22:22:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:21,792 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2025-01-09 22:22:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:22:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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 28 [2025-01-09 22:22:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:21,794 INFO L225 Difference]: With dead ends: 261 [2025-01-09 22:22:21,794 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 22:22:21,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=792, Unknown=15, NotChecked=320, Total=1332 [2025-01-09 22:22:21,795 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 59 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:21,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1620 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1077 Invalid, 0 Unknown, 572 Unchecked, 0.6s Time] [2025-01-09 22:22:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 22:22:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 251. [2025-01-09 22:22:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 188 states have (on average 1.5212765957446808) internal successors, (286), 246 states have internal predecessors, (286), 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-01-09 22:22:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2025-01-09 22:22:21,799 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 28 [2025-01-09 22:22:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:21,799 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2025-01-09 22:22:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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-01-09 22:22:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2025-01-09 22:22:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:22:21,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:21,801 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-01-09 22:22:21,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:22,005 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 340888018, now seen corresponding path program 1 times [2025-01-09 22:22:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078149106] [2025-01-09 22:22:22,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:22,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:22:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:22:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:22,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078149106] [2025-01-09 22:22:22,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078149106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:22,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:22,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:22,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513966137] [2025-01-09 22:22:22,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:22,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:22,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:22,095 INFO L87 Difference]: Start difference. First operand 251 states and 290 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-01-09 22:22:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:22,256 INFO L93 Difference]: Finished difference Result 247 states and 278 transitions. [2025-01-09 22:22:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:22,257 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-01-09 22:22:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:22,259 INFO L225 Difference]: With dead ends: 247 [2025-01-09 22:22:22,259 INFO L226 Difference]: Without dead ends: 247 [2025-01-09 22:22:22,260 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-01-09 22:22:22,260 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:22,260 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.2s Time] [2025-01-09 22:22:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-09 22:22:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-09 22:22:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 188 states have (on average 1.4574468085106382) internal successors, (274), 242 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-01-09 22:22:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2025-01-09 22:22:22,265 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 43 [2025-01-09 22:22:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:22,265 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2025-01-09 22:22:22,265 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-01-09 22:22:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2025-01-09 22:22:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:22:22,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:22,266 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-01-09 22:22:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:22:22,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 340888019, now seen corresponding path program 1 times [2025-01-09 22:22:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196179462] [2025-01-09 22:22:22,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:22:22,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:22:22,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:22,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196179462] [2025-01-09 22:22:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196179462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11837866] [2025-01-09 22:22:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:22,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:22,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:22,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:22,353 INFO L87 Difference]: Start difference. First operand 247 states and 278 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-01-09 22:22:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:22,498 INFO L93 Difference]: Finished difference Result 243 states and 266 transitions. [2025-01-09 22:22:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:22,499 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-01-09 22:22:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:22,500 INFO L225 Difference]: With dead ends: 243 [2025-01-09 22:22:22,500 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 22:22:22,501 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-01-09 22:22:22,501 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-01-09 22:22:22,501 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-01-09 22:22:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 22:22:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-01-09 22:22:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 188 states have (on average 1.3936170212765957) internal successors, (262), 238 states have internal predecessors, (262), 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-01-09 22:22:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 266 transitions. [2025-01-09 22:22:22,505 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 266 transitions. Word has length 43 [2025-01-09 22:22:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:22,506 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 266 transitions. [2025-01-09 22:22:22,506 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-01-09 22:22:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 266 transitions. [2025-01-09 22:22:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:22:22,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:22,510 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] [2025-01-09 22:22:22,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:22:22,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1178648214, now seen corresponding path program 1 times [2025-01-09 22:22:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579119348] [2025-01-09 22:22:22,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:22,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:22:22,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:22:22,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:22,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579119348] [2025-01-09 22:22:22,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579119348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:22,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:22:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678960604] [2025-01-09 22:22:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:22,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:22:22,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:22,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:22:22,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:22,729 INFO L87 Difference]: Start difference. First operand 243 states and 266 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-01-09 22:22:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:23,016 INFO L93 Difference]: Finished difference Result 253 states and 278 transitions. [2025-01-09 22:22:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-09 22:22:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:23,018 INFO L225 Difference]: With dead ends: 253 [2025-01-09 22:22:23,018 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 22:22:23,018 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-01-09 22:22:23,019 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 36 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 494 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-01-09 22:22:23,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 494 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 22:22:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2025-01-09 22:22:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 244 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-01-09 22:22:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2025-01-09 22:22:23,024 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 45 [2025-01-09 22:22:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:23,024 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2025-01-09 22:22:23,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-01-09 22:22:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2025-01-09 22:22:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:22:23,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:23,026 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] [2025-01-09 22:22:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:22:23,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1178648215, now seen corresponding path program 1 times [2025-01-09 22:22:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401651503] [2025-01-09 22:22:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:23,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:22:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:22:23,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:23,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:23,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:23,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401651503] [2025-01-09 22:22:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401651503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:22:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694081547] [2025-01-09 22:22:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:22:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:23,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:22:23,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:23,351 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-01-09 22:22:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:23,744 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2025-01-09 22:22:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:22:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-09 22:22:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:23,745 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:22:23,745 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:22:23,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-01-09 22:22:23,746 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 41 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:23,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 537 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:22:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:22:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2025-01-09 22:22:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 194 states have (on average 1.3814432989690721) 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-01-09 22:22:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 274 transitions. [2025-01-09 22:22:23,750 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 274 transitions. Word has length 45 [2025-01-09 22:22:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:23,750 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 274 transitions. [2025-01-09 22:22:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-01-09 22:22:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2025-01-09 22:22:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:22:23,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:23,751 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] [2025-01-09 22:22:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:22:23,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1190428475, now seen corresponding path program 1 times [2025-01-09 22:22:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88143798] [2025-01-09 22:22:23,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:22:23,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:22:23,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:23,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88143798] [2025-01-09 22:22:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88143798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:22:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598324426] [2025-01-09 22:22:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:23,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:22:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:23,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:22:23,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:23,973 INFO L87 Difference]: Start difference. First operand 251 states and 274 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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-01-09 22:22:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:24,235 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2025-01-09 22:22:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-09 22:22:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:24,236 INFO L225 Difference]: With dead ends: 256 [2025-01-09 22:22:24,236 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 22:22:24,237 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-01-09 22:22:24,237 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 40 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:24,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 444 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 22:22:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2025-01-09 22:22:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.380710659898477) internal successors, (272), 247 states have internal predecessors, (272), 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-01-09 22:22:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 278 transitions. [2025-01-09 22:22:24,242 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 278 transitions. Word has length 47 [2025-01-09 22:22:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:24,242 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 278 transitions. [2025-01-09 22:22:24,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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-01-09 22:22:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2025-01-09 22:22:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:22:24,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:24,243 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] [2025-01-09 22:22:24,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:22:24,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:24,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1190428474, now seen corresponding path program 1 times [2025-01-09 22:22:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852465954] [2025-01-09 22:22:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:24,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:22:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:22:24,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:24,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:24,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852465954] [2025-01-09 22:22:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852465954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:24,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:22:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590195481] [2025-01-09 22:22:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:24,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:24,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:24,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:24,614 INFO L87 Difference]: Start difference. First operand 254 states and 278 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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-01-09 22:22:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:24,971 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2025-01-09 22:22:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:22:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-09 22:22:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:24,973 INFO L225 Difference]: With dead ends: 258 [2025-01-09 22:22:24,973 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 22:22:24,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:22:24,974 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 133 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:24,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 610 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 22:22:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 253. [2025-01-09 22:22:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 246 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-01-09 22:22:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 276 transitions. [2025-01-09 22:22:24,980 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 276 transitions. Word has length 47 [2025-01-09 22:22:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:24,980 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 276 transitions. [2025-01-09 22:22:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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-01-09 22:22:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2025-01-09 22:22:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:22:24,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:24,980 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] [2025-01-09 22:22:24,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:22:24,980 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:24,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1540459130, now seen corresponding path program 1 times [2025-01-09 22:22:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387703658] [2025-01-09 22:22:24,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:24,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:22:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:22:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387703658] [2025-01-09 22:22:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387703658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:25,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79811039] [2025-01-09 22:22:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:25,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:25,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:25,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:25,044 INFO L87 Difference]: Start difference. First operand 253 states and 276 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-01-09 22:22:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:25,132 INFO L93 Difference]: Finished difference Result 252 states and 275 transitions. [2025-01-09 22:22:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-09 22:22:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:25,133 INFO L225 Difference]: With dead ends: 252 [2025-01-09 22:22:25,133 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 22:22:25,134 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-01-09 22:22:25,135 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-01-09 22:22:25,135 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-01-09 22:22:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 22:22:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-01-09 22:22:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 197 states have (on average 1.365482233502538) internal successors, (269), 245 states have internal predecessors, (269), 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-01-09 22:22:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 275 transitions. [2025-01-09 22:22:25,138 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 275 transitions. Word has length 49 [2025-01-09 22:22:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 275 transitions. [2025-01-09 22:22:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-01-09 22:22:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 275 transitions. [2025-01-09 22:22:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:22:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:25,139 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] [2025-01-09 22:22:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:22:25,139 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1540459129, now seen corresponding path program 1 times [2025-01-09 22:22:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921445938] [2025-01-09 22:22:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:25,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:22:25,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:22:25,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:25,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:25,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921445938] [2025-01-09 22:22:25,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921445938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:25,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564145855] [2025-01-09 22:22:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:25,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:25,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:25,247 INFO L87 Difference]: Start difference. First operand 252 states and 275 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-01-09 22:22:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:25,350 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2025-01-09 22:22:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:25,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-09 22:22:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:25,351 INFO L225 Difference]: With dead ends: 244 [2025-01-09 22:22:25,351 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 22:22:25,351 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-01-09 22:22:25,352 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 96 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:25,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 300 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 22:22:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-01-09 22:22:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 237 states have internal predecessors, (261), 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-01-09 22:22:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2025-01-09 22:22:25,356 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 49 [2025-01-09 22:22:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:25,357 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2025-01-09 22:22:25,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-01-09 22:22:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2025-01-09 22:22:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:22:25,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:25,357 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-01-09 22:22:25,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:22:25,357 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -509592626, now seen corresponding path program 1 times [2025-01-09 22:22:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308762286] [2025-01-09 22:22:25,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:25,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:22:25,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:22:25,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:25,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:25,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308762286] [2025-01-09 22:22:25,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308762286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:25,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368741189] [2025-01-09 22:22:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:25,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:25,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:25,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:25,492 INFO L87 Difference]: Start difference. First operand 244 states and 267 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-01-09 22:22:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:25,655 INFO L93 Difference]: Finished difference Result 266 states and 292 transitions. [2025-01-09 22:22:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:25,656 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-01-09 22:22:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:25,657 INFO L225 Difference]: With dead ends: 266 [2025-01-09 22:22:25,657 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 22:22:25,657 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-01-09 22:22:25,657 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:25,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 445 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 22:22:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 243. [2025-01-09 22:22:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 236 states have internal predecessors, (260), 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-01-09 22:22:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 266 transitions. [2025-01-09 22:22:25,661 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 266 transitions. Word has length 50 [2025-01-09 22:22:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 266 transitions. [2025-01-09 22:22:25,662 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-01-09 22:22:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 266 transitions. [2025-01-09 22:22:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:22:25,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:25,662 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-01-09 22:22:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:22:25,662 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:25,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -509592625, now seen corresponding path program 1 times [2025-01-09 22:22:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302367380] [2025-01-09 22:22:25,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:25,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:22:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:22:25,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302367380] [2025-01-09 22:22:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302367380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531576708] [2025-01-09 22:22:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:25,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:25,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:25,858 INFO L87 Difference]: Start difference. First operand 243 states and 266 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-01-09 22:22:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:26,055 INFO L93 Difference]: Finished difference Result 280 states and 308 transitions. [2025-01-09 22:22:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:26,056 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-01-09 22:22:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:26,057 INFO L225 Difference]: With dead ends: 280 [2025-01-09 22:22:26,057 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 22:22:26,057 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-01-09 22:22:26,057 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-01-09 22:22:26,057 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-01-09 22:22:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 22:22:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 242. [2025-01-09 22:22:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.3147208121827412) 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-01-09 22:22:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2025-01-09 22:22:26,062 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 50 [2025-01-09 22:22:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:26,062 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2025-01-09 22:22:26,062 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-01-09 22:22:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2025-01-09 22:22:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:22:26,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:26,063 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] [2025-01-09 22:22:26,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:22:26,063 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:26,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1554554452, now seen corresponding path program 1 times [2025-01-09 22:22:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366922311] [2025-01-09 22:22:26,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:26,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:22:26,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:22:26,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:26,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366922311] [2025-01-09 22:22:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366922311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:26,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222997959] [2025-01-09 22:22:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:26,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:26,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:26,134 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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-01-09 22:22:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:26,280 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2025-01-09 22:22:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:22:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:26,281 INFO L225 Difference]: With dead ends: 264 [2025-01-09 22:22:26,281 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 22:22:26,281 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-01-09 22:22:26,281 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-01-09 22:22:26,282 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-01-09 22:22:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 22:22:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 241. [2025-01-09 22:22:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.3096446700507614) 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-01-09 22:22:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2025-01-09 22:22:26,289 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 54 [2025-01-09 22:22:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:26,290 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2025-01-09 22:22:26,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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-01-09 22:22:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2025-01-09 22:22:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:22:26,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:26,291 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] [2025-01-09 22:22:26,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:22:26,291 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1554554453, now seen corresponding path program 1 times [2025-01-09 22:22:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791257338] [2025-01-09 22:22:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:26,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:22:26,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:22:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:26,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791257338] [2025-01-09 22:22:26,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791257338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:26,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:26,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212153781] [2025-01-09 22:22:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:26,398 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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-01-09 22:22:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:26,535 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2025-01-09 22:22:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:22:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:26,536 INFO L225 Difference]: With dead ends: 277 [2025-01-09 22:22:26,537 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 22:22:26,537 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-01-09 22:22:26,538 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-01-09 22:22:26,538 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-01-09 22:22:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 22:22:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 240. [2025-01-09 22:22:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3045685279187818) 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-01-09 22:22:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2025-01-09 22:22:26,544 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 54 [2025-01-09 22:22:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2025-01-09 22:22:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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-01-09 22:22:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2025-01-09 22:22:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:22:26,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:26,545 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-01-09 22:22:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:22:26,545 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 946547917, now seen corresponding path program 1 times [2025-01-09 22:22:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030151986] [2025-01-09 22:22:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:26,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:22:26,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:22:26,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:26,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030151986] [2025-01-09 22:22:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030151986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:26,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:22:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188935554] [2025-01-09 22:22:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:26,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:26,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:26,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:26,848 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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-01-09 22:22:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:27,134 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2025-01-09 22:22:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:22:27,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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-01-09 22:22:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:27,135 INFO L225 Difference]: With dead ends: 281 [2025-01-09 22:22:27,135 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 22:22:27,135 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-01-09 22:22:27,135 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:27,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 614 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 22:22:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 249. [2025-01-09 22:22:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.3009708737864079) 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-01-09 22:22:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2025-01-09 22:22:27,144 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 55 [2025-01-09 22:22:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:27,144 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2025-01-09 22:22:27,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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-01-09 22:22:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2025-01-09 22:22:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:22:27,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:27,145 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-01-09 22:22:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:22:27,145 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 946547918, now seen corresponding path program 1 times [2025-01-09 22:22:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139579778] [2025-01-09 22:22:27,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:27,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:22:27,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:22:27,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:27,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139579778] [2025-01-09 22:22:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139579778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687219454] [2025-01-09 22:22:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:27,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:22:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:27,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:22:27,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:22:27,479 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 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-01-09 22:22:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:27,764 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2025-01-09 22:22:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:22:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 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-01-09 22:22:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:27,766 INFO L225 Difference]: With dead ends: 293 [2025-01-09 22:22:27,766 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 22:22:27,766 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-01-09 22:22:27,768 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 112 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:27,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 765 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 22:22:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 249. [2025-01-09 22:22:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.296116504854369) internal successors, (267), 242 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-01-09 22:22:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 273 transitions. [2025-01-09 22:22:27,774 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 273 transitions. Word has length 55 [2025-01-09 22:22:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:27,774 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 273 transitions. [2025-01-09 22:22:27,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 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-01-09 22:22:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 273 transitions. [2025-01-09 22:22:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:22:27,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:27,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:27,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:22:27,775 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1152332798, now seen corresponding path program 1 times [2025-01-09 22:22:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725186599] [2025-01-09 22:22:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:27,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:22:27,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:22:27,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:27,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725186599] [2025-01-09 22:22:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725186599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460618580] [2025-01-09 22:22:27,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:27,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:27,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:27,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:27,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:22:27,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:22:28,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:22:28,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:28,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:22:28,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:28,022 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-01-09 22:22:28,044 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:22:28,044 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-01-09 22:22:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:28,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460618580] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:28,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-01-09 22:22:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855570356] [2025-01-09 22:22:28,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:28,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:28,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:28,075 INFO L87 Difference]: Start difference. First operand 249 states and 273 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 22:22:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:28,162 INFO L93 Difference]: Finished difference Result 248 states and 271 transitions. [2025-01-09 22:22:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:28,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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 57 [2025-01-09 22:22:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:28,163 INFO L225 Difference]: With dead ends: 248 [2025-01-09 22:22:28,163 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 22:22:28,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 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-01-09 22:22:28,164 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:28,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 252 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 22:22:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-01-09 22:22:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 241 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-01-09 22:22:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 271 transitions. [2025-01-09 22:22:28,170 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 271 transitions. Word has length 57 [2025-01-09 22:22:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:28,170 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 271 transitions. [2025-01-09 22:22:28,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 22:22:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 271 transitions. [2025-01-09 22:22:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:22:28,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:28,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:28,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:22:28,372 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1152332797, now seen corresponding path program 1 times [2025-01-09 22:22:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162345388] [2025-01-09 22:22:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:28,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:22:28,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:22:28,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:28,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162345388] [2025-01-09 22:22:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162345388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143463062] [2025-01-09 22:22:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:28,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:22:28,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:22:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:22:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:28,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:22:28,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:28,708 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-01-09 22:22:28,710 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-01-09 22:22:28,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:28,761 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-01-09 22:22:28,772 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:28,772 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-01-09 22:22:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:28,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:22:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143463062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:28,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-01-09 22:22:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536740801] [2025-01-09 22:22:28,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:22:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:28,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:22:28,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:28,993 INFO L87 Difference]: Start difference. First operand 248 states and 271 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 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-01-09 22:22:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:29,224 INFO L93 Difference]: Finished difference Result 244 states and 263 transitions. [2025-01-09 22:22:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 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 57 [2025-01-09 22:22:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:29,225 INFO L225 Difference]: With dead ends: 244 [2025-01-09 22:22:29,225 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 22:22:29,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:29,226 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 35 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:29,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 554 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 22:22:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2025-01-09 22:22:29,231 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-01-09 22:22:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2025-01-09 22:22:29,231 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 57 [2025-01-09 22:22:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2025-01-09 22:22:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 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-01-09 22:22:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2025-01-09 22:22:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:22:29,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:29,233 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-01-09 22:22:29,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:22:29,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:29,437 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:29,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1359803221, now seen corresponding path program 1 times [2025-01-09 22:22:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:29,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851554389] [2025-01-09 22:22:29,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:29,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:22:29,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:22:29,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:29,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:22:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851554389] [2025-01-09 22:22:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851554389] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643405474] [2025-01-09 22:22:29,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:29,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:29,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:29,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:22:30,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:22:30,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:22:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:30,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:30,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:22:30,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:30,058 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-01-09 22:22:30,110 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 19 treesize of output 1 [2025-01-09 22:22:30,142 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 38 treesize of output 20 [2025-01-09 22:22:30,148 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select .cse0 v_arrayElimCell_33) 0) (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store .cse0 v_arrayElimCell_33 (select |c_#valid| v_arrayElimCell_33)))))) is different from true [2025-01-09 22:22:30,321 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (v_arrayElimCell_33 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (not (= create_data_~nextData~0.base v_arrayElimCell_33)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_33 (select |c_#valid| v_arrayElimCell_33)) create_data_~nextData~0.base 1)) (= (select .cse0 v_arrayElimCell_33) 0) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) (exists ((create_data_~data~0.base Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select .cse1 v_arrayElimCell_33) 0) (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store .cse1 v_arrayElimCell_33 1)))))) is different from true [2025-01-09 22:22:30,807 INFO L349 Elim1Store]: treesize reduction 290, result has 32.7 percent of original size [2025-01-09 22:22:30,807 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 7 new quantified variables, introduced 22 case distinctions, treesize of input 64 treesize of output 215 [2025-01-09 22:22:32,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:32,842 INFO L349 Elim1Store]: treesize reduction 416, result has 17.0 percent of original size [2025-01-09 22:22:32,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 73 treesize of output 165 [2025-01-09 22:22:33,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:33,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:33,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,135 INFO L349 Elim1Store]: treesize reduction 149, result has 0.7 percent of original size [2025-01-09 22:22:33,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 63 treesize of output 1 [2025-01-09 22:22:33,391 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,394 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,401 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-09 22:22:33,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2025-01-09 22:22:33,430 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,439 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-01-09 22:22:33,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 1 [2025-01-09 22:22:33,454 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,455 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:33,466 INFO L349 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2025-01-09 22:22:33,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 1 [2025-01-09 22:22:33,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:34,419 INFO L349 Elim1Store]: treesize reduction 2778, result has 0.0 percent of original size [2025-01-09 22:22:34,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 77 case distinctions, treesize of input 181 treesize of output 1 [2025-01-09 22:22:34,517 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:35,192 INFO L349 Elim1Store]: treesize reduction 2834, result has 0.0 percent of original size [2025-01-09 22:22:35,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 77 case distinctions, treesize of input 199 treesize of output 1 [2025-01-09 22:22:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 7 not checked. [2025-01-09 22:22:37,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643405474] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:37,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:22:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2025-01-09 22:22:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625574643] [2025-01-09 22:22:37,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:37,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:22:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:37,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:22:37,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=225, Unknown=2, NotChecked=62, Total=342 [2025-01-09 22:22:37,295 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:22:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:39,084 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2025-01-09 22:22:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:22:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2025-01-09 22:22:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:39,085 INFO L225 Difference]: With dead ends: 323 [2025-01-09 22:22:39,085 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 22:22:39,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=618, Unknown=2, NotChecked=106, Total=870 [2025-01-09 22:22:39,086 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 217 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:39,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 594 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 583 Invalid, 0 Unknown, 399 Unchecked, 1.0s Time] [2025-01-09 22:22:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 22:22:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 262. [2025-01-09 22:22:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 222 states have (on average 1.2477477477477477) internal successors, (277), 253 states have internal predecessors, (277), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:22:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2025-01-09 22:22:39,092 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 58 [2025-01-09 22:22:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2025-01-09 22:22:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:22:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2025-01-09 22:22:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:22:39,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:39,094 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-01-09 22:22:39,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:22:39,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-09 22:22:39,299 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:39,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1359803220, now seen corresponding path program 1 times [2025-01-09 22:22:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077755520] [2025-01-09 22:22:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:22:39,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:22:39,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:39,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:22:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077755520] [2025-01-09 22:22:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077755520] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623779355] [2025-01-09 22:22:40,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:40,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:40,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:40,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:40,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:22:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:22:40,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:22:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:40,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:22:40,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:40,206 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-01-09 22:22:40,208 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-01-09 22:22:42,290 INFO L349 Elim1Store]: treesize reduction 236, result has 28.9 percent of original size [2025-01-09 22:22:42,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 466 [2025-01-09 22:22:42,511 INFO L224 Elim1Store]: Index analysis took 176 ms [2025-01-09 22:22:43,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:43,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 108 treesize of output 378