./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.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/20020406-1.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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:17:05,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:17:05,789 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:17:05,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:17:05,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:17:05,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:17:05,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:17:05,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:17:05,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:17:05,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:17:05,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:17:05,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:17:05,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:17:05,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:17:05,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:17:05,827 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:17:05,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:17:05,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:17:05,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:17:05,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:17:05,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:17:05,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:17:05,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:17:05,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:17:05,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:17:05,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:17:05,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:17:05,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:17:05,831 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2025-01-09 22:17:06,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:17:06,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:17:06,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:17:06,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:17:06,172 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:17:06,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2025-01-09 22:17:07,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/901f00372/7ab5afb1fc624a5197766e0ac28159cf/FLAGd9be3d3f6 [2025-01-09 22:17:07,842 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:17:07,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2025-01-09 22:17:07,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/901f00372/7ab5afb1fc624a5197766e0ac28159cf/FLAGd9be3d3f6 [2025-01-09 22:17:07,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/901f00372/7ab5afb1fc624a5197766e0ac28159cf [2025-01-09 22:17:07,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:17:07,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:17:07,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:17:07,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:17:07,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:17:07,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:07" (1/1) ... [2025-01-09 22:17:07,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:07, skipping insertion in model container [2025-01-09 22:17:07,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:07" (1/1) ... [2025-01-09 22:17:07,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:17:08,295 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:17:08,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:17:08,333 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:17:08,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:17:08,448 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:17:08,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08 WrapperNode [2025-01-09 22:17:08,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:17:08,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:17:08,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:17:08,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:17:08,454 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:17:08" (1/1) ... [2025-01-09 22:17:08,473 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:17:08" (1/1) ... [2025-01-09 22:17:08,495 INFO L138 Inliner]: procedures = 283, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-01-09 22:17:08,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:17:08,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:17:08,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:17:08,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:17:08,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,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:17:08" (1/1) ... [2025-01-09 22:17:08,553 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 2, 17, 9]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 16 writes are split as follows [0, 2, 8, 6]. [2025-01-09 22:17:08,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:17:08,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:17:08,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:17:08,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:17:08,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (1/1) ... [2025-01-09 22:17:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:17:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:08,617 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:17:08,620 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:17:08,643 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-01-09 22:17:08,646 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-01-09 22:17:08,647 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-01-09 22:17:08,647 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-01-09 22:17:08,647 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-01-09 22:17:08,647 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:17:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-01-09 22:17:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-01-09 22:17:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-01-09 22:17:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:17:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:17:08,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:17:08,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:17:08,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:17:08,830 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:17:08,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:17:09,335 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-01-09 22:17:09,335 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:17:09,353 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:17:09,353 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:17:09,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:09 BoogieIcfgContainer [2025-01-09 22:17:09,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:17:09,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:17:09,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:17:09,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:17:09,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:17:07" (1/3) ... [2025-01-09 22:17:09,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797ec3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:09, skipping insertion in model container [2025-01-09 22:17:09,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:08" (2/3) ... [2025-01-09 22:17:09,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797ec3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:09, skipping insertion in model container [2025-01-09 22:17:09,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:09" (3/3) ... [2025-01-09 22:17:09,364 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-01-09 22:17:09,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:17:09,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 192 locations, 1 initial locations, 3 loop locations, and 55 error locations. [2025-01-09 22:17:09,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:17:09,445 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;@93b4b3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:17:09,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-09 22:17:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:17:09,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:09,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:17:09,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash 232998552, now seen corresponding path program 1 times [2025-01-09 22:17:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-01-09 22:17:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:09,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:17:09,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:17:09,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:09,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:09,696 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:17:09,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-01-09 22:17:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886465658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557849723] [2025-01-09 22:17:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:09,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:09,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:09,750 INFO L87 Difference]: Start difference. First operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:17:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:09,934 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-01-09 22:17:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:17:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:09,946 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:17:09,947 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:17:09,950 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:17:09,952 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:09,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:17:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-09 22:17:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 92 states have (on average 1.641304347826087) internal successors, (151), 144 states have internal predecessors, (151), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-01-09 22:17:10,021 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 5 [2025-01-09 22:17:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:10,021 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-01-09 22:17:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:17:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-01-09 22:17:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:17:10,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:10,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:17:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:17:10,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash 232998553, now seen corresponding path program 1 times [2025-01-09 22:17:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359734749] [2025-01-09 22:17:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:10,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:17:10,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:17:10,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:10,178 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:17:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:10,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359734749] [2025-01-09 22:17:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359734749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:10,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:10,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:10,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707455809] [2025-01-09 22:17:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:10,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:10,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:10,180 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:17:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:10,308 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-01-09 22:17:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:17:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:10,311 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:17:10,311 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 22:17:10,311 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:17:10,312 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:10,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 376 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 22:17:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-01-09 22:17:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 145 states have internal predecessors, (152), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-01-09 22:17:10,338 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 5 [2025-01-09 22:17:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:10,338 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-01-09 22:17:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:17:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-01-09 22:17:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:17:10,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:10,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:10,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:17:10,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:10,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 573308570, now seen corresponding path program 1 times [2025-01-09 22:17:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646888422] [2025-01-09 22:17:10,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:10,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:17:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:17:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:10,576 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:17:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646888422] [2025-01-09 22:17:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646888422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:10,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462905745] [2025-01-09 22:17:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:17:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:10,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:17:10,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:10,579 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:17:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:10,743 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-01-09 22:17:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:10,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-01-09 22:17:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:10,746 INFO L225 Difference]: With dead ends: 182 [2025-01-09 22:17:10,747 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 22:17:10,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:10,747 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 14 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:10,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 22:17:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-01-09 22:17:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-01-09 22:17:10,769 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 7 [2025-01-09 22:17:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-01-09 22:17:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:17:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-01-09 22:17:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:17:10,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:10,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:17:10,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 409168730, now seen corresponding path program 1 times [2025-01-09 22:17:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138864290] [2025-01-09 22:17:10,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:10,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:17:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:17:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:10,972 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:17:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138864290] [2025-01-09 22:17:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138864290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:17:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964573291] [2025-01-09 22:17:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:17:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:10,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:17:10,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:10,974 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:17:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:11,205 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-01-09 22:17:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-01-09 22:17:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:11,210 INFO L225 Difference]: With dead ends: 182 [2025-01-09 22:17:11,210 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 22:17:11,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:11,211 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:11,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 826 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 22:17:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-01-09 22:17:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 92 states have (on average 1.576086956521739) internal successors, (145), 138 states have internal predecessors, (145), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2025-01-09 22:17:11,228 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 11 [2025-01-09 22:17:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:11,228 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2025-01-09 22:17:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:17:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2025-01-09 22:17:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:17:11,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:11,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:17:11,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash -200671202, now seen corresponding path program 1 times [2025-01-09 22:17:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629147502] [2025-01-09 22:17:11,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:11,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:17:11,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:17:11,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:11,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:11,576 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:17:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629147502] [2025-01-09 22:17:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629147502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:11,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820025254] [2025-01-09 22:17:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:11,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:11,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:11,579 INFO L87 Difference]: Start difference. First operand 179 states and 215 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:17:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:11,895 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-01-09 22:17:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:17:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:11,897 INFO L225 Difference]: With dead ends: 195 [2025-01-09 22:17:11,897 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 22:17:11,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:17:11,898 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 25 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:11,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1244 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 22:17:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-09 22:17:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 153 states have internal predecessors, (161), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2025-01-09 22:17:11,915 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 12 [2025-01-09 22:17:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2025-01-09 22:17:11,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:17:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2025-01-09 22:17:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:17:11,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:11,916 INFO L218 NwaCegarLoop]: trace histogram [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:17:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:17:11,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 54082167, now seen corresponding path program 1 times [2025-01-09 22:17:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-01-09 22:17:11,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:11,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:17:11,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:17:11,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:12,040 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:17:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-01-09 22:17:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:17:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005447529] [2025-01-09 22:17:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:17:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:12,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:17:12,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:12,043 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:12,231 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2025-01-09 22:17:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:17:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:12,233 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:17:12,233 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:17:12,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:12,234 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:12,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 783 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:17:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 22:17:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.485981308411215) internal successors, (159), 151 states have internal predecessors, (159), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2025-01-09 22:17:12,241 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 21 [2025-01-09 22:17:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2025-01-09 22:17:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2025-01-09 22:17:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:17:12,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:12,242 INFO L218 NwaCegarLoop]: trace histogram [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:17:12,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:17:12,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:12,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 54082168, now seen corresponding path program 1 times [2025-01-09 22:17:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202377294] [2025-01-09 22:17:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:12,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:17:12,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:17:12,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:12,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:12,460 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:17:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202377294] [2025-01-09 22:17:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202377294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:17:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591996954] [2025-01-09 22:17:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:12,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:12,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:12,462 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:12,661 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2025-01-09 22:17:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:12,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:17:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:12,665 INFO L225 Difference]: With dead ends: 191 [2025-01-09 22:17:12,665 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 22:17:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:12,666 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 980 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 22:17:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-09 22:17:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 149 states have internal predecessors, (157), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2025-01-09 22:17:12,679 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 21 [2025-01-09 22:17:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:12,680 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2025-01-09 22:17:12,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2025-01-09 22:17:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:17:12,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:12,682 INFO L218 NwaCegarLoop]: trace histogram [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:17:12,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:17:12,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:12,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1676547370, now seen corresponding path program 1 times [2025-01-09 22:17:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129996106] [2025-01-09 22:17:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:12,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:17:12,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:17:12,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:12,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:12,960 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:17:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129996106] [2025-01-09 22:17:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129996106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:12,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:12,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993324637] [2025-01-09 22:17:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:12,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:12,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:12,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:12,962 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:13,069 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2025-01-09 22:17:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:17:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:13,072 INFO L225 Difference]: With dead ends: 217 [2025-01-09 22:17:13,072 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 22:17:13,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:13,073 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 18 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:13,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 22:17:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-01-09 22:17:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.435483870967742) internal successors, (178), 166 states have internal predecessors, (178), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-01-09 22:17:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-01-09 22:17:13,086 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 22 [2025-01-09 22:17:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-01-09 22:17:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-01-09 22:17:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:17:13,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:13,086 INFO L218 NwaCegarLoop]: trace histogram [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:17:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:17:13,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -809998102, now seen corresponding path program 1 times [2025-01-09 22:17:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040005120] [2025-01-09 22:17:13,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:13,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:13,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:13,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:13,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:13,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040005120] [2025-01-09 22:17:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040005120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:13,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528424965] [2025-01-09 22:17:13,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:13,414 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:17:13,416 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:17:13,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:13,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:13,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:13,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:13,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:17:13,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:13,605 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:17:13,611 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:17:13,763 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 47 treesize of output 29 [2025-01-09 22:17:13,768 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 38 treesize of output 26 [2025-01-09 22:17:13,788 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 51 treesize of output 29 [2025-01-09 22:17:13,792 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 42 treesize of output 26 [2025-01-09 22:17:13,895 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 29 treesize of output 17 [2025-01-09 22:17:13,902 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 32 treesize of output 14 [2025-01-09 22:17:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:13,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528424965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-01-09 22:17:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718582905] [2025-01-09 22:17:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:17:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:17:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:17:13,925 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:14,371 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2025-01-09 22:17:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:17:14,371 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:17:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:14,374 INFO L225 Difference]: With dead ends: 213 [2025-01-09 22:17:14,374 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 22:17:14,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:17:14,375 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 23 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:14,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1276 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 22:17:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2025-01-09 22:17:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 165 states have internal predecessors, (177), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-01-09 22:17:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-01-09 22:17:14,386 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 23 [2025-01-09 22:17:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:14,387 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-01-09 22:17:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-01-09 22:17:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:17:14,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:14,387 INFO L218 NwaCegarLoop]: trace histogram [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:17:14,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:14,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:14,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:14,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash -809998103, now seen corresponding path program 1 times [2025-01-09 22:17:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136390674] [2025-01-09 22:17:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:14,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:14,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:14,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:14,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136390674] [2025-01-09 22:17:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136390674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120352104] [2025-01-09 22:17:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:14,860 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:17:14,862 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:17:14,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:14,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:14,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:14,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:14,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:17:14,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:14,993 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:17:15,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:17:15,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 22:17:15,100 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 21 treesize of output 9 [2025-01-09 22:17:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:15,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120352104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:15,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-09 22:17:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683061815] [2025-01-09 22:17:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:15,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:17:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:15,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:17:15,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:17:15,117 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:15,421 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-01-09 22:17:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:17:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:15,423 INFO L225 Difference]: With dead ends: 212 [2025-01-09 22:17:15,423 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 22:17:15,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:17:15,426 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:15,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1295 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 22:17:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-01-09 22:17:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 164 states have internal predecessors, (176), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-01-09 22:17:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-01-09 22:17:15,440 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 23 [2025-01-09 22:17:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-01-09 22:17:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-01-09 22:17:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:17:15,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:15,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:15,449 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:17:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:15,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1891975010, now seen corresponding path program 1 times [2025-01-09 22:17:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344652407] [2025-01-09 22:17:15,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:15,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:17:15,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:17:15,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344652407] [2025-01-09 22:17:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344652407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910724979] [2025-01-09 22:17:15,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:15,925 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:17:15,927 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:17:16,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:17:16,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:17:16,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:16,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:16,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:17:16,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:16,099 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:17:16,129 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:17:16,132 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:17:16,171 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 27 treesize of output 15 [2025-01-09 22:17:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:16,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910724979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-01-09 22:17:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881387677] [2025-01-09 22:17:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:16,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:16,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:17:16,300 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:16,656 INFO L93 Difference]: Finished difference Result 215 states and 256 transitions. [2025-01-09 22:17:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:17:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:17:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:16,658 INFO L225 Difference]: With dead ends: 215 [2025-01-09 22:17:16,658 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 22:17:16,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:17:16,660 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:16,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1204 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 22:17:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2025-01-09 22:17:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 163 states have internal predecessors, (173), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2025-01-09 22:17:16,668 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 35 [2025-01-09 22:17:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:16,668 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2025-01-09 22:17:16,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:17:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2025-01-09 22:17:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:17:16,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:16,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-01-09 22:17:16,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:17:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:16,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2124051241, now seen corresponding path program 1 times [2025-01-09 22:17:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68579424] [2025-01-09 22:17:16,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:16,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:17:16,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:17:16,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:17:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68579424] [2025-01-09 22:17:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68579424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:17:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985477195] [2025-01-09 22:17:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:16,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:16,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:16,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:16,975 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:17,035 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2025-01-09 22:17:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:17:17,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-09 22:17:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:17,037 INFO L225 Difference]: With dead ends: 216 [2025-01-09 22:17:17,037 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 22:17:17,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:17,038 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:17,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 768 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 22:17:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2025-01-09 22:17:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 163 states have internal predecessors, (172), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2025-01-09 22:17:17,046 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 36 [2025-01-09 22:17:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,046 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2025-01-09 22:17:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2025-01-09 22:17:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:17:17,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:17:17,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1623789387, now seen corresponding path program 1 times [2025-01-09 22:17:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-01-09 22:17:17,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:17:17,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:17:17,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:17:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297628439] [2025-01-09 22:17:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297628439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:17:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795525273] [2025-01-09 22:17:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:17,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:17:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:17,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:17:17,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:17,183 INFO L87 Difference]: Start difference. First operand 206 states and 242 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:17,383 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2025-01-09 22:17:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:17,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-09 22:17:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:17,385 INFO L225 Difference]: With dead ends: 204 [2025-01-09 22:17:17,385 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 22:17:17,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:17,386 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:17,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 764 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 22:17:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 22:17:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 161 states have internal predecessors, (170), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2025-01-09 22:17:17,393 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 44 [2025-01-09 22:17:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,393 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2025-01-09 22:17:17,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2025-01-09 22:17:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:17:17,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:17:17,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:17,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1623789386, now seen corresponding path program 1 times [2025-01-09 22:17:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110563081] [2025-01-09 22:17:17,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:17:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:17:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:17:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110563081] [2025-01-09 22:17:17,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110563081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:17,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:17,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:17:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546786547] [2025-01-09 22:17:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:17,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:17,615 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:17,808 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2025-01-09 22:17:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-09 22:17:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:17,811 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:17:17,812 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:17:17,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:17,813 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:17,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 955 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:17:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-09 22:17:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.3658536585365855) internal successors, (168), 159 states have internal predecessors, (168), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2025-01-09 22:17:17,824 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 44 [2025-01-09 22:17:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,825 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2025-01-09 22:17:17,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2025-01-09 22:17:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:17:17,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:17:17,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1202136759, now seen corresponding path program 1 times [2025-01-09 22:17:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-01-09 22:17:17,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:17:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:17:17,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-01-09 22:17:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431349026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001064040] [2025-01-09 22:17:18,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:18,105 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:17:18,107 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:17:18,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:17:18,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:17:18,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:18,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:18,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:17:18,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:18,273 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:17:18,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:17:18,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 22:17:18,353 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 21 treesize of output 9 [2025-01-09 22:17:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:17:18,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001064040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-09 22:17:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284146935] [2025-01-09 22:17:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:18,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:17:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:18,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:17:18,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:17:18,368 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:18,667 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2025-01-09 22:17:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-01-09 22:17:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:18,669 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:17:18,669 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:17:18,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:17:18,670 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 10 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1262 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:17:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2025-01-09 22:17:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 158 states have internal predecessors, (167), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2025-01-09 22:17:18,679 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 45 [2025-01-09 22:17:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2025-01-09 22:17:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2025-01-09 22:17:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:17:18,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:18,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:18,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:17:18,883 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,SelfDestructingSolverStorable14 [2025-01-09 22:17:18,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1202136760, now seen corresponding path program 1 times [2025-01-09 22:17:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132363727] [2025-01-09 22:17:18,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:18,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:17:18,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:17:18,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:18,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132363727] [2025-01-09 22:17:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132363727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115203024] [2025-01-09 22:17:19,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:19,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:19,174 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:17:19,176 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:17:19,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:17:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:17:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:19,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:17:19,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:19,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:17:19,393 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:17:19,521 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 47 treesize of output 29 [2025-01-09 22:17:19,526 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 38 treesize of output 26 [2025-01-09 22:17:19,539 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 51 treesize of output 29 [2025-01-09 22:17:19,545 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 42 treesize of output 26 [2025-01-09 22:17:19,633 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 29 treesize of output 17 [2025-01-09 22:17:19,635 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 32 treesize of output 14 [2025-01-09 22:17:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:17:19,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115203024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:19,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-01-09 22:17:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756702725] [2025-01-09 22:17:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:19,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:17:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:19,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:17:19,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:17:19,657 INFO L87 Difference]: Start difference. First operand 201 states and 237 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:20,102 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2025-01-09 22:17:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:17:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-01-09 22:17:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:20,104 INFO L225 Difference]: With dead ends: 205 [2025-01-09 22:17:20,104 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 22:17:20,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:17:20,105 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:20,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1578 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 22:17:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-01-09 22:17:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 157 states have internal predecessors, (166), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 22:17:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2025-01-09 22:17:20,113 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 45 [2025-01-09 22:17:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:20,114 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2025-01-09 22:17:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:17:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2025-01-09 22:17:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:17:20,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:20,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:20,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:20,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 22:17:20,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 101372625, now seen corresponding path program 1 times [2025-01-09 22:17:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997938908] [2025-01-09 22:17:20,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:20,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:17:20,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:17:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:20,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:21,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997938908] [2025-01-09 22:17:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997938908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022666221] [2025-01-09 22:17:21,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:21,061 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:17:21,064 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:17:21,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:17:21,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:17:21,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:21,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:17:21,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:21,294 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:17:21,321 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 35 treesize of output 17 [2025-01-09 22:17:21,486 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-01-09 22:17:21,486 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 2 case distinctions, treesize of input 17 treesize of output 18 [2025-01-09 22:17:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:21,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022666221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 25 [2025-01-09 22:17:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864977119] [2025-01-09 22:17:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:21,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:17:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:21,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:17:21,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:17:21,602 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:17:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:23,059 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2025-01-09 22:17:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:17:23,060 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-01-09 22:17:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:23,061 INFO L225 Difference]: With dead ends: 253 [2025-01-09 22:17:23,061 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 22:17:23,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:17:23,063 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 638 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 427 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:23,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 876 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1272 Invalid, 23 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 22:17:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 22:17:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2025-01-09 22:17:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 142 states have (on average 1.352112676056338) internal successors, (192), 176 states have internal predecessors, (192), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2025-01-09 22:17:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-01-09 22:17:23,070 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 52 [2025-01-09 22:17:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:23,071 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-01-09 22:17:23,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:17:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-01-09 22:17:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:17:23,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:23,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:23,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:23,276 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,SelfDestructingSolverStorable16 [2025-01-09 22:17:23,276 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash 101372626, now seen corresponding path program 1 times [2025-01-09 22:17:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428285111] [2025-01-09 22:17:23,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:23,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:17:23,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:17:23,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:23,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:24,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428285111] [2025-01-09 22:17:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428285111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151649913] [2025-01-09 22:17:24,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:24,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:24,690 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:17:24,693 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:17:24,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:17:24,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:17:24,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:24,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:24,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:17:24,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:25,445 INFO L349 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2025-01-09 22:17:25,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2025-01-09 22:17:25,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:25,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-01-09 22:17:25,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2025-01-09 22:17:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:17:26,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151649913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 30 [2025-01-09 22:17:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538389330] [2025-01-09 22:17:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:17:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:17:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:17:26,151 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 12 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:17:30,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:34,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:35,324 INFO L93 Difference]: Finished difference Result 269 states and 327 transitions. [2025-01-09 22:17:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:17:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-01-09 22:17:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:35,326 INFO L225 Difference]: With dead ends: 269 [2025-01-09 22:17:35,326 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 22:17:35,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:17:35,327 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 160 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:35,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 819 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1172 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2025-01-09 22:17:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 22:17:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2025-01-09 22:17:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 181 states have internal predecessors, (195), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-01-09 22:17:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2025-01-09 22:17:35,339 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 52 [2025-01-09 22:17:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2025-01-09 22:17:35,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:17:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2025-01-09 22:17:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:17:35,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:35,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:35,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:17:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:35,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 41412628, now seen corresponding path program 1 times [2025-01-09 22:17:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315037860] [2025-01-09 22:17:35,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:35,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:17:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:17:35,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:17:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315037860] [2025-01-09 22:17:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315037860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:17:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216548786] [2025-01-09 22:17:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:17:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:35,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:17:35,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:35,758 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:17:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:36,210 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2025-01-09 22:17:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:36,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-01-09 22:17:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:36,212 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:17:36,212 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:17:36,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:17:36,213 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 57 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:36,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1187 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:17:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:17:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-01-09 22:17:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 187 states have internal predecessors, (203), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-01-09 22:17:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 290 transitions. [2025-01-09 22:17:36,223 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 290 transitions. Word has length 59 [2025-01-09 22:17:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:36,223 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 290 transitions. [2025-01-09 22:17:36,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:17:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 290 transitions. [2025-01-09 22:17:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:17:36,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:36,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:36,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:17:36,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 41412629, now seen corresponding path program 1 times [2025-01-09 22:17:36,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:36,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669613519] [2025-01-09 22:17:36,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:36,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:17:36,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:17:36,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:36,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:17:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669613519] [2025-01-09 22:17:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669613519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:17:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114340765] [2025-01-09 22:17:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:36,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:17:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:36,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:17:36,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:17:36,610 INFO L87 Difference]: Start difference. First operand 241 states and 290 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:17:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:37,124 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2025-01-09 22:17:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:17:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-01-09 22:17:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:37,126 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:17:37,126 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:17:37,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:17:37,127 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 58 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:37,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1386 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:17:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:17:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2025-01-09 22:17:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 187 states have internal predecessors, (202), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-01-09 22:17:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2025-01-09 22:17:37,136 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 59 [2025-01-09 22:17:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:37,136 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2025-01-09 22:17:37,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:17:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2025-01-09 22:17:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 22:17:37,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:37,137 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:17:37,137 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 192449981, now seen corresponding path program 1 times [2025-01-09 22:17:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537486808] [2025-01-09 22:17:37,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:37,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:17:37,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:17:37,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:37,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:17:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537486808] [2025-01-09 22:17:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537486808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904073713] [2025-01-09 22:17:37,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:37,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:37,370 INFO L229 MonitoredProcess]: Starting monitored process 9 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:17:37,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:17:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:17:37,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:17:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:37,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:17:37,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:17:37,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:17:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904073713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:37,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 9 [2025-01-09 22:17:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964504520] [2025-01-09 22:17:37,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:17:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:37,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:17:37,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:37,736 INFO L87 Difference]: Start difference. First operand 241 states and 289 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:17:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:38,444 INFO L93 Difference]: Finished difference Result 298 states and 362 transitions. [2025-01-09 22:17:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:17:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-01-09 22:17:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:38,447 INFO L225 Difference]: With dead ends: 298 [2025-01-09 22:17:38,447 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 22:17:38,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:17:38,447 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 269 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:38,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 815 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:17:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 22:17:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 281. [2025-01-09 22:17:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 179 states have (on average 1.324022346368715) internal successors, (237), 217 states have internal predecessors, (237), 49 states have call successors, (49), 17 states have call predecessors, (49), 21 states have return successors, (59), 49 states have call predecessors, (59), 49 states have call successors, (59) [2025-01-09 22:17:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 345 transitions. [2025-01-09 22:17:38,456 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 345 transitions. Word has length 69 [2025-01-09 22:17:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 345 transitions. [2025-01-09 22:17:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:17:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 345 transitions. [2025-01-09 22:17:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 22:17:38,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:38,457 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:38,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:38,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:38,658 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:38,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash 192449982, now seen corresponding path program 1 times [2025-01-09 22:17:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:38,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046175775] [2025-01-09 22:17:38,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:38,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:17:38,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:17:38,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:38,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:17:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046175775] [2025-01-09 22:17:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046175775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111862579] [2025-01-09 22:17:39,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:39,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:39,113 INFO L229 MonitoredProcess]: Starting monitored process 10 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:17:39,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:17:39,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 22:17:39,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 22:17:39,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:39,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:39,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:17:39,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:17:39,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:39,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:17:39,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:39,629 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 15 treesize of output 19 [2025-01-09 22:17:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:17:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111862579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:39,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2025-01-09 22:17:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361944719] [2025-01-09 22:17:39,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:39,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:17:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:39,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:17:39,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:17:39,724 INFO L87 Difference]: Start difference. First operand 281 states and 345 transitions. Second operand has 25 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 22:17:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:40,735 INFO L93 Difference]: Finished difference Result 385 states and 470 transitions. [2025-01-09 22:17:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:17:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-01-09 22:17:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:40,737 INFO L225 Difference]: With dead ends: 385 [2025-01-09 22:17:40,737 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 22:17:40,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:17:40,739 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:40,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2499 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:17:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 22:17:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 341. [2025-01-09 22:17:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 215 states have (on average 1.3906976744186046) internal successors, (299), 253 states have internal predecessors, (299), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-01-09 22:17:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 451 transitions. [2025-01-09 22:17:40,749 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 451 transitions. Word has length 69 [2025-01-09 22:17:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 451 transitions. [2025-01-09 22:17:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 22:17:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 451 transitions. [2025-01-09 22:17:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 22:17:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:40,751 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:40,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:40,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -694531160, now seen corresponding path program 2 times [2025-01-09 22:17:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823963859] [2025-01-09 22:17:40,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:17:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:40,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 22:17:40,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 76 statements. [2025-01-09 22:17:40,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:17:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:17:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823963859] [2025-01-09 22:17:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823963859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527996447] [2025-01-09 22:17:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:41,216 INFO L87 Difference]: Start difference. First operand 341 states and 451 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:17:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:41,468 INFO L93 Difference]: Finished difference Result 344 states and 454 transitions. [2025-01-09 22:17:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:41,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2025-01-09 22:17:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:41,471 INFO L225 Difference]: With dead ends: 344 [2025-01-09 22:17:41,471 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 22:17:41,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:41,471 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:41,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 792 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 22:17:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2025-01-09 22:17:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 217 states have (on average 1.3870967741935485) internal successors, (301), 255 states have internal predecessors, (301), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-01-09 22:17:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 453 transitions. [2025-01-09 22:17:41,483 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 453 transitions. Word has length 76 [2025-01-09 22:17:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:41,483 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 453 transitions. [2025-01-09 22:17:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:17:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 453 transitions. [2025-01-09 22:17:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:17:41,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:41,484 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:41,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:17:41,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -327570192, now seen corresponding path program 3 times [2025-01-09 22:17:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605571630] [2025-01-09 22:17:41,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:17:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:41,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-01-09 22:17:41,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-01-09 22:17:41,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:17:41,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:17:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605571630] [2025-01-09 22:17:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605571630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870318579] [2025-01-09 22:17:42,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:17:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:42,695 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:17:42,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-01-09 22:17:42,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-01-09 22:17:42,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:17:42,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:42,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:17:42,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:43,097 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:17:43,134 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 33 treesize of output 15 [2025-01-09 22:17:43,244 WARN L873 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_#res#1.base| 1) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| 1))) is different from true [2025-01-09 22:17:43,275 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:17:43,276 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 2 case distinctions, treesize of input 15 treesize of output 19 [2025-01-09 22:17:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:17:43,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:17:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870318579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:44,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:44,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 14] total 38 [2025-01-09 22:17:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326107251] [2025-01-09 22:17:44,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:17:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:17:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1204, Unknown=1, NotChecked=70, Total=1406 [2025-01-09 22:17:44,241 INFO L87 Difference]: Start difference. First operand 343 states and 453 transitions. Second operand has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 32 states have internal predecessors, (108), 5 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 22:17:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:49,756 INFO L93 Difference]: Finished difference Result 407 states and 500 transitions. [2025-01-09 22:17:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 22:17:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 32 states have internal predecessors, (108), 5 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 77 [2025-01-09 22:17:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:49,758 INFO L225 Difference]: With dead ends: 407 [2025-01-09 22:17:49,758 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 22:17:49,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=626, Invalid=4069, Unknown=1, NotChecked=134, Total=4830 [2025-01-09 22:17:49,760 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1503 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 4752 mSolverCounterSat, 999 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 6136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 4752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:49,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 2831 Invalid, 6136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 4752 Invalid, 0 Unknown, 385 Unchecked, 4.4s Time] [2025-01-09 22:17:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 22:17:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 348. [2025-01-09 22:17:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 222 states have (on average 1.3783783783783783) internal successors, (306), 259 states have internal predecessors, (306), 74 states have call successors, (74), 19 states have call predecessors, (74), 21 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-01-09 22:17:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2025-01-09 22:17:49,770 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 77 [2025-01-09 22:17:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:49,770 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2025-01-09 22:17:49,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 32 states have internal predecessors, (108), 5 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 22:17:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2025-01-09 22:17:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 22:17:49,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:49,771 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:49,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:17:49,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 22:17:49,972 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1836682071, now seen corresponding path program 2 times [2025-01-09 22:17:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:49,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654801503] [2025-01-09 22:17:49,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:17:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:49,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-09 22:17:50,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 22:17:50,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:17:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:17:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654801503] [2025-01-09 22:17:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654801503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106653331] [2025-01-09 22:17:50,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:17:50,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:50,474 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17:50,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:17:50,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-09 22:17:50,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 22:17:50,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:17:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:50,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:17:50,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:17:51,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:51,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:17:51,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:51,430 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 15 treesize of output 19 [2025-01-09 22:17:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:17:51,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106653331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:51,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 41 [2025-01-09 22:17:51,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650309891] [2025-01-09 22:17:51,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:17:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:51,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:17:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:17:51,605 INFO L87 Difference]: Start difference. First operand 348 states and 458 transitions. Second operand has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2025-01-09 22:17:55,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:57,179 INFO L93 Difference]: Finished difference Result 396 states and 478 transitions. [2025-01-09 22:17:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:17:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) Word has length 78 [2025-01-09 22:17:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:57,182 INFO L225 Difference]: With dead ends: 396 [2025-01-09 22:17:57,182 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 22:17:57,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=2519, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:17:57,183 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 535 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 2663 mSolverCounterSat, 184 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:57,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3054 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2663 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-01-09 22:17:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 22:17:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 358. [2025-01-09 22:17:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.3608695652173912) internal successors, (313), 267 states have internal predecessors, (313), 74 states have call successors, (74), 21 states have call predecessors, (74), 23 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-01-09 22:17:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 465 transitions. [2025-01-09 22:17:57,195 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 465 transitions. Word has length 78 [2025-01-09 22:17:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:57,195 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 465 transitions. [2025-01-09 22:17:57,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2025-01-09 22:17:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 465 transitions. [2025-01-09 22:17:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:17:57,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:57,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:17:57,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:57,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:17:57,397 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:57,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1496834274, now seen corresponding path program 1 times [2025-01-09 22:17:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027137713] [2025-01-09 22:17:57,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:57,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:17:57,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:17:57,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 22:17:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:57,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027137713] [2025-01-09 22:17:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027137713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608613075] [2025-01-09 22:17:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:57,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:57,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:57,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:57,458 INFO L87 Difference]: Start difference. First operand 358 states and 465 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 22:17:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:57,465 INFO L93 Difference]: Finished difference Result 361 states and 465 transitions. [2025-01-09 22:17:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 77 [2025-01-09 22:17:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:57,467 INFO L225 Difference]: With dead ends: 361 [2025-01-09 22:17:57,467 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 22:17:57,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:57,468 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:57,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 22:17:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-01-09 22:17:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.3478260869565217) internal successors, (310), 267 states have internal predecessors, (310), 74 states have call successors, (74), 21 states have call predecessors, (74), 23 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-01-09 22:17:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 462 transitions. [2025-01-09 22:17:57,476 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 462 transitions. Word has length 77 [2025-01-09 22:17:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:57,477 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 462 transitions. [2025-01-09 22:17:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 22:17:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 462 transitions. [2025-01-09 22:17:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 22:17:57,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:57,477 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-01-09 22:17:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:17:57,478 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:57,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1132986684, now seen corresponding path program 1 times [2025-01-09 22:17:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774411193] [2025-01-09 22:17:57,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:57,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 22:17:57,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 22:17:57,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:57,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 22:17:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:57,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774411193] [2025-01-09 22:17:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774411193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:57,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243320836] [2025-01-09 22:17:57,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:57,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:57,786 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17:57,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:17:57,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 22:17:58,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 22:17:58,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:58,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:17:58,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:58,067 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:17:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 22:17:58,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243320836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:58,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2025-01-09 22:17:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058506763] [2025-01-09 22:17:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:58,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:17:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:58,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:17:58,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:17:58,280 INFO L87 Difference]: Start difference. First operand 358 states and 462 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:17:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:58,542 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2025-01-09 22:17:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:17:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2025-01-09 22:17:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:58,544 INFO L225 Difference]: With dead ends: 352 [2025-01-09 22:17:58,544 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 22:17:58,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:17:58,545 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 57 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:58,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1299 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 22:17:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2025-01-09 22:17:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 213 states have (on average 1.352112676056338) internal successors, (288), 249 states have internal predecessors, (288), 70 states have call successors, (70), 19 states have call predecessors, (70), 21 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-01-09 22:17:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 432 transitions. [2025-01-09 22:17:58,555 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 432 transitions. Word has length 84 [2025-01-09 22:17:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 432 transitions. [2025-01-09 22:17:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:17:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 432 transitions. [2025-01-09 22:17:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 22:17:58,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:58,558 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:58,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:17:58,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:58,759 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:17:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2013302446, now seen corresponding path program 3 times [2025-01-09 22:17:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225801977] [2025-01-09 22:17:58,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:17:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:58,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 4 equivalence classes. [2025-01-09 22:17:58,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 63 of 88 statements. [2025-01-09 22:17:58,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:17:58,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 22:17:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225801977] [2025-01-09 22:17:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225801977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556240212] [2025-01-09 22:17:59,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:17:59,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:59,931 INFO L229 MonitoredProcess]: Starting monitored process 14 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:17:59,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:18:00,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 4 equivalence classes. [2025-01-09 22:18:00,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 63 of 88 statements. [2025-01-09 22:18:00,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:18:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:00,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:18:00,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 22:18:00,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 22:18:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556240212] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:00,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 28 [2025-01-09 22:18:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565142145] [2025-01-09 22:18:00,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:18:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:00,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:18:00,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:18:00,660 INFO L87 Difference]: Start difference. First operand 335 states and 432 transitions. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 22:18:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:01,575 INFO L93 Difference]: Finished difference Result 376 states and 495 transitions. [2025-01-09 22:18:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:18:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2025-01-09 22:18:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:01,577 INFO L225 Difference]: With dead ends: 376 [2025-01-09 22:18:01,577 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 22:18:01,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=491, Invalid=1765, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:18:01,578 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:01,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1959 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:18:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 22:18:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2025-01-09 22:18:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 255 states have internal predecessors, (294), 70 states have call successors, (70), 19 states have call predecessors, (70), 21 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-01-09 22:18:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 438 transitions. [2025-01-09 22:18:01,594 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 438 transitions. Word has length 88 [2025-01-09 22:18:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:01,594 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 438 transitions. [2025-01-09 22:18:01,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 2 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 22:18:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 438 transitions. [2025-01-09 22:18:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 22:18:01,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:01,595 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:01,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:18:01,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:18:01,796 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-09 22:18:01,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1454832466, now seen corresponding path program 4 times [2025-01-09 22:18:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407263128] [2025-01-09 22:18:01,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:18:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:01,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-01-09 22:18:01,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 94 statements. [2025-01-09 22:18:01,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:18:01,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 22:18:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407263128] [2025-01-09 22:18:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407263128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635621766] [2025-01-09 22:18:02,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:18:02,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:02,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:02,236 INFO L229 MonitoredProcess]: Starting monitored process 15 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:18:02,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:18:02,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-01-09 22:18:02,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 94 statements. [2025-01-09 22:18:02,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:18:02,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:02,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-09 22:18:02,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:02,557 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 8 treesize of output 1 [2025-01-09 22:18:03,198 INFO L349 Elim1Store]: treesize reduction 6, result has 91.8 percent of original size [2025-01-09 22:18:03,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 83 [2025-01-09 22:18:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-09 22:18:03,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-09 22:18:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635621766] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:04,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 48 [2025-01-09 22:18:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927958912] [2025-01-09 22:18:04,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:04,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:18:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:04,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:18:04,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2113, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:18:04,398 INFO L87 Difference]: Start difference. First operand 341 states and 438 transitions. Second operand has 48 states, 43 states have (on average 2.395348837209302) internal successors, (103), 40 states have internal predecessors, (103), 15 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-09 22:18:08,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:12,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:16,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:20,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:24,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]