./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:07:14,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:07:15,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:07:15,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:07:15,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:07:15,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:07:15,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:07:15,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:07:15,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:07:15,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:07:15,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:07:15,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:07:15,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:07:15,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:07:15,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:07:15,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:07:15,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:07:15,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:15,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:07:15,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:07:15,043 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 ! call(reach_error())) ) 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2025-02-07 20:07:15,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:07:15,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:07:15,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:07:15,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:07:15,291 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:07:15,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-02-07 20:07:16,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71561c78/66eaeaf163f748b8b3c5e03af668c045/FLAG45c8fdaf4 [2025-02-07 20:07:16,790 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:07:16,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-02-07 20:07:16,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71561c78/66eaeaf163f748b8b3c5e03af668c045/FLAG45c8fdaf4 [2025-02-07 20:07:16,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71561c78/66eaeaf163f748b8b3c5e03af668c045 [2025-02-07 20:07:16,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:07:16,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:07:16,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:16,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:07:16,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:07:16,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:16" (1/1) ... [2025-02-07 20:07:16,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59db5b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:16, skipping insertion in model container [2025-02-07 20:07:16,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:16" (1/1) ... [2025-02-07 20:07:16,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:07:17,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2025-02-07 20:07:17,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2025-02-07 20:07:17,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2025-02-07 20:07:17,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2025-02-07 20:07:17,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2025-02-07 20:07:17,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2025-02-07 20:07:17,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2025-02-07 20:07:17,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:17,051 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:07:17,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2025-02-07 20:07:17,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2025-02-07 20:07:17,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2025-02-07 20:07:17,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2025-02-07 20:07:17,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2025-02-07 20:07:17,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2025-02-07 20:07:17,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2025-02-07 20:07:17,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:17,100 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:07:17,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17 WrapperNode [2025-02-07 20:07:17,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:17,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:17,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:07:17,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:07:17,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,126 INFO L138 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 143 [2025-02-07 20:07:17,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:17,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:07:17,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:07:17,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:07:17,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,142 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-07 20:07:17,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:07:17,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:07:17,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:07:17,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:07:17,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (1/1) ... [2025-02-07 20:07:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:17,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:17,173 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-02-07 20:07:17,178 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-02-07 20:07:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:07:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:07:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:07:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:07:17,264 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:07:17,265 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:07:17,437 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 20:07:17,437 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:07:17,443 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:07:17,443 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:07:17,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:17 BoogieIcfgContainer [2025-02-07 20:07:17,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:07:17,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:07:17,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:07:17,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:07:17,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:07:16" (1/3) ... [2025-02-07 20:07:17,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe128e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:17, skipping insertion in model container [2025-02-07 20:07:17,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:17" (2/3) ... [2025-02-07 20:07:17,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe128e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:17, skipping insertion in model container [2025-02-07 20:07:17,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:17" (3/3) ... [2025-02-07 20:07:17,450 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2025-02-07 20:07:17,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:07:17,461 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-sentinel-1.i that has 1 procedures, 47 locations, 1 initial locations, 10 loop locations, and 7 error locations. [2025-02-07 20:07:17,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:07:17,512 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=LoopHeads, 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;@5bd4a93e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:07:17,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-07 20:07:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 46 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:07:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:17,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:07:17,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1220229315, now seen corresponding path program 1 times [2025-02-07 20:07:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286964731] [2025-02-07 20:07:17,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:07:17,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:07:17,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:17,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286964731] [2025-02-07 20:07:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286964731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:07:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98780550] [2025-02-07 20:07:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:07:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:17,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:07:17,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:17,762 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 46 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:17,772 INFO L93 Difference]: Finished difference Result 93 states and 147 transitions. [2025-02-07 20:07:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:07:17,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 20:07:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:17,778 INFO L225 Difference]: With dead ends: 93 [2025-02-07 20:07:17,778 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 20:07:17,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:17,783 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:17,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 20:07:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-07 20:07:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-02-07 20:07:17,811 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 6 [2025-02-07 20:07:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:17,811 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-02-07 20:07:17,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-02-07 20:07:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:07:17,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:17,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:07:17,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 825811428, now seen corresponding path program 1 times [2025-02-07 20:07:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374811891] [2025-02-07 20:07:17,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:07:17,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:07:17,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:17,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374811891] [2025-02-07 20:07:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374811891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954991545] [2025-02-07 20:07:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:17,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:17,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:17,965 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:18,040 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-07 20:07:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:07:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:07:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:18,041 INFO L225 Difference]: With dead ends: 49 [2025-02-07 20:07:18,041 INFO L226 Difference]: Without dead ends: 47 [2025-02-07 20:07:18,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:18,042 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:18,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-07 20:07:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-02-07 20:07:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-02-07 20:07:18,046 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2025-02-07 20:07:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:18,046 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-02-07 20:07:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-02-07 20:07:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:07:18,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:18,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:18,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:07:18,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 827504549, now seen corresponding path program 1 times [2025-02-07 20:07:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497991820] [2025-02-07 20:07:18,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:18,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:07:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:07:18,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:18,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:18,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497991820] [2025-02-07 20:07:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497991820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:18,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366081769] [2025-02-07 20:07:18,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:18,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:18,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:18,204 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:18,274 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-02-07 20:07:18,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:07:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:07:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:18,274 INFO L225 Difference]: With dead ends: 41 [2025-02-07 20:07:18,274 INFO L226 Difference]: Without dead ends: 39 [2025-02-07 20:07:18,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:18,276 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:18,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-07 20:07:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-07 20:07:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-07 20:07:18,279 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2025-02-07 20:07:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-07 20:07:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-07 20:07:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:07:18,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:18,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:07:18,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 176474717, now seen corresponding path program 1 times [2025-02-07 20:07:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40514934] [2025-02-07 20:07:18,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:07:18,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:07:18,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40514934] [2025-02-07 20:07:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40514934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:18,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236097589] [2025-02-07 20:07:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:18,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:18,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:18,427 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:18,535 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2025-02-07 20:07:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:07:18,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:07:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:18,539 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:07:18,539 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 20:07:18,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:07:18,539 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:18,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 100 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 20:07:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2025-02-07 20:07:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-07 20:07:18,550 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 10 [2025-02-07 20:07:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:18,551 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-07 20:07:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-07 20:07:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:07:18,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:18,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:18,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:07:18,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:18,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -923340299, now seen corresponding path program 1 times [2025-02-07 20:07:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905124615] [2025-02-07 20:07:18,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:18,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:07:18,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:07:18,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:18,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905124615] [2025-02-07 20:07:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905124615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440534442] [2025-02-07 20:07:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:18,742 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:18,818 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-07 20:07:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:07:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:07:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:18,819 INFO L225 Difference]: With dead ends: 47 [2025-02-07 20:07:18,819 INFO L226 Difference]: Without dead ends: 45 [2025-02-07 20:07:18,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:18,820 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-07 20:07:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-07 20:07:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-07 20:07:18,828 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 10 [2025-02-07 20:07:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-07 20:07:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-07 20:07:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 20:07:18,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:18,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:07:18,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2035594909, now seen corresponding path program 1 times [2025-02-07 20:07:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999390012] [2025-02-07 20:07:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:18,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 20:07:18,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 20:07:18,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:18,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999390012] [2025-02-07 20:07:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999390012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111177009] [2025-02-07 20:07:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:19,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:19,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:19,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:19,012 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:19,067 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-02-07 20:07:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:07:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 20:07:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:19,068 INFO L225 Difference]: With dead ends: 45 [2025-02-07 20:07:19,068 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 20:07:19,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:19,069 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:19,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 20:07:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-07 20:07:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-02-07 20:07:19,077 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2025-02-07 20:07:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-02-07 20:07:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-02-07 20:07:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:07:19,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:19,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:19,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:07:19,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1818665882, now seen corresponding path program 1 times [2025-02-07 20:07:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:19,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014338118] [2025-02-07 20:07:19,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:07:19,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:07:19,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:19,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014338118] [2025-02-07 20:07:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014338118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096561159] [2025-02-07 20:07:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:19,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:19,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:19,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:19,130 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:19,200 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-02-07 20:07:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:19,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:07:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:19,201 INFO L225 Difference]: With dead ends: 59 [2025-02-07 20:07:19,202 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 20:07:19,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:19,203 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:19,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 20:07:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-02-07 20:07:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-07 20:07:19,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2025-02-07 20:07:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:19,214 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-07 20:07:19,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-07 20:07:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:07:19,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:19,214 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:07:19,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -673373079, now seen corresponding path program 1 times [2025-02-07 20:07:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766426821] [2025-02-07 20:07:19,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:07:19,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:07:19,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:19,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766426821] [2025-02-07 20:07:19,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766426821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51837233] [2025-02-07 20:07:19,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:19,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:19,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:19,371 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-02-07 20:07:19,374 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-02-07 20:07:19,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:07:19,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:07:19,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:19,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:19,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:07:19,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:19,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-07 20:07:19,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-07 20:07:19,666 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 15 treesize of output 7 [2025-02-07 20:07:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51837233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:19,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:19,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 20:07:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233933722] [2025-02-07 20:07:19,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:07:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:19,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:07:19,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:07:19,746 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:19,875 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-02-07 20:07:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:07:19,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 20:07:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:19,876 INFO L225 Difference]: With dead ends: 63 [2025-02-07 20:07:19,876 INFO L226 Difference]: Without dead ends: 39 [2025-02-07 20:07:19,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:07:19,877 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:19,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 104 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-07 20:07:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-07 20:07:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-07 20:07:19,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2025-02-07 20:07:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-07 20:07:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-07 20:07:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:07:19,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:19,883 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:19,889 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-02-07 20:07:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:20,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1364827948, now seen corresponding path program 1 times [2025-02-07 20:07:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716571486] [2025-02-07 20:07:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:20,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:07:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716571486] [2025-02-07 20:07:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716571486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641201260] [2025-02-07 20:07:20,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:20,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:20,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:20,400 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-02-07 20:07:20,403 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-02-07 20:07:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:07:20,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:20,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:20,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 20:07:20,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:20,508 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-02-07 20:07:20,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-07 20:07:20,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:20,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2025-02-07 20:07:20,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:07:20,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:07:20,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:07:20,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:20,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:07:20,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:20,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 20:07:20,593 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 18 treesize of output 13 [2025-02-07 20:07:20,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:07:20,605 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 69 treesize of output 41 [2025-02-07 20:07:20,619 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 18 treesize of output 13 [2025-02-07 20:07:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:20,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:20,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-02-07 20:07:20,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:20,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2025-02-07 20:07:20,692 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 71 treesize of output 51 [2025-02-07 20:07:20,696 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 24 treesize of output 22 [2025-02-07 20:07:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641201260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:20,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:20,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-02-07 20:07:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189836230] [2025-02-07 20:07:20,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:07:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:20,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:07:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-02-07 20:07:20,847 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:25,121 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2025-02-07 20:07:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:07:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:07:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:25,122 INFO L225 Difference]: With dead ends: 123 [2025-02-07 20:07:25,122 INFO L226 Difference]: Without dead ends: 121 [2025-02-07 20:07:25,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=256, Unknown=2, NotChecked=34, Total=380 [2025-02-07 20:07:25,123 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:25,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 222 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 18 Unknown, 126 Unchecked, 4.1s Time] [2025-02-07 20:07:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-07 20:07:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2025-02-07 20:07:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-02-07 20:07:25,136 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 22 [2025-02-07 20:07:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-02-07 20:07:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-02-07 20:07:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:07:25,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:25,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:25,147 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-02-07 20:07:25,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:25,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:25,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 520356077, now seen corresponding path program 1 times [2025-02-07 20:07:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036582685] [2025-02-07 20:07:25,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:25,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:07:25,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:25,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:25,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036582685] [2025-02-07 20:07:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036582685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242395175] [2025-02-07 20:07:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:25,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:25,824 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-02-07 20:07:25,826 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-02-07 20:07:25,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:07:25,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:25,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:25,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:25,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 20:07:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:25,936 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-02-07 20:07:25,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 20:07:25,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:25,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2025-02-07 20:07:25,984 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:25,996 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:07:25,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:07:26,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 20:07:26,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:07:26,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:07:26,023 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 18 treesize of output 13 [2025-02-07 20:07:26,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-07 20:07:26,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:07:26,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2025-02-07 20:07:26,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:26,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:26,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:26,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 103 [2025-02-07 20:07:26,244 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 202 treesize of output 154 [2025-02-07 20:07:26,248 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 115 treesize of output 109 [2025-02-07 20:07:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242395175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:26,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-02-07 20:07:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684617427] [2025-02-07 20:07:26,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:07:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:26,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:07:26,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:07:26,492 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:26,811 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-02-07 20:07:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:07:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:07:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:26,812 INFO L225 Difference]: With dead ends: 82 [2025-02-07 20:07:26,812 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 20:07:26,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:07:26,813 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 114 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:26,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 124 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:07:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 20:07:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2025-02-07 20:07:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-02-07 20:07:26,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2025-02-07 20:07:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:26,818 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-02-07 20:07:26,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-02-07 20:07:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 20:07:26,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:26,818 INFO L218 NwaCegarLoop]: trace histogram [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-02-07 20:07:26,827 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-02-07 20:07:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:27,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1712080328, now seen corresponding path program 1 times [2025-02-07 20:07:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386659267] [2025-02-07 20:07:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:07:27,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:07:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386659267] [2025-02-07 20:07:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386659267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361427112] [2025-02-07 20:07:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:27,467 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-02-07 20:07:27,471 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-02-07 20:07:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:07:27,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:07:27,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:27,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:27,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 20:07:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:27,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-07 20:07:27,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:27,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2025-02-07 20:07:27,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:27,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:27,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-02-07 20:07:27,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:07:27,622 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:07:27,622 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 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-07 20:07:27,624 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 5 treesize of output 3 [2025-02-07 20:07:27,631 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 5 treesize of output 3 [2025-02-07 20:07:27,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2025-02-07 20:07:27,671 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:07:27,672 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-07 20:07:27,676 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 5 treesize of output 3 [2025-02-07 20:07:27,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:07:27,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:07:27,714 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:07:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2025-02-07 20:07:27,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-02-07 20:07:27,722 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 24 treesize of output 11 [2025-02-07 20:07:27,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-07 20:07:27,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:07:27,894 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 15 treesize of output 7 [2025-02-07 20:07:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:27,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:28,017 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 72 treesize of output 52 [2025-02-07 20:07:28,023 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_806 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_ArrVal_808 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2025-02-07 20:07:28,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:28,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2025-02-07 20:07:28,066 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2025-02-07 20:07:28,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 143 [2025-02-07 20:07:28,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 353 treesize of output 339 [2025-02-07 20:07:28,115 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 230 treesize of output 222 [2025-02-07 20:07:28,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:28,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 337 treesize of output 314 [2025-02-07 20:07:28,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:28,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 252 [2025-02-07 20:07:28,175 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 227 treesize of output 221 [2025-02-07 20:07:28,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:28,810 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 29 treesize of output 29 [2025-02-07 20:07:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361427112] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:28,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:28,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2025-02-07 20:07:28,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726274997] [2025-02-07 20:07:28,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 20:07:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:28,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 20:07:28,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=529, Unknown=1, NotChecked=46, Total=650 [2025-02-07 20:07:28,855 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:29,492 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-02-07 20:07:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:07:29,493 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 20:07:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:29,493 INFO L225 Difference]: With dead ends: 100 [2025-02-07 20:07:29,494 INFO L226 Difference]: Without dead ends: 87 [2025-02-07 20:07:29,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=989, Unknown=1, NotChecked=66, Total=1260 [2025-02-07 20:07:29,495 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 124 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:29,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 464 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 393 Invalid, 0 Unknown, 79 Unchecked, 0.4s Time] [2025-02-07 20:07:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-07 20:07:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2025-02-07 20:07:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-02-07 20:07:29,503 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 30 [2025-02-07 20:07:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-02-07 20:07:29,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-02-07 20:07:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 20:07:29,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:29,504 INFO L218 NwaCegarLoop]: trace histogram [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-02-07 20:07:29,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:07:29,708 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,SelfDestructingSolverStorable10 [2025-02-07 20:07:29,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-07 20:07:29,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -750466311, now seen corresponding path program 1 times [2025-02-07 20:07:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655851627] [2025-02-07 20:07:29,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:29,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:07:29,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:07:29,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:29,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655851627] [2025-02-07 20:07:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655851627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313854808] [2025-02-07 20:07:30,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:30,180 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-02-07 20:07:30,183 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-02-07 20:07:30,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:07:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:07:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:30,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-07 20:07:30,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:30,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-07 20:07:30,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 20:07:30,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:07:30,328 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:07:30,329 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 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-07 20:07:30,331 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 5 treesize of output 3 [2025-02-07 20:07:30,335 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 5 treesize of output 3 [2025-02-07 20:07:30,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:07:30,372 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:07:30,373 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 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-07 20:07:30,379 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 5 treesize of output 3 [2025-02-07 20:07:30,382 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 5 treesize of output 3 [2025-02-07 20:07:30,398 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:07:30,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:07:30,408 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:30,484 INFO L349 Elim1Store]: treesize reduction 207, result has 9.6 percent of original size [2025-02-07 20:07:30,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 242 treesize of output 217 [2025-02-07 20:07:30,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:30,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:30,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:30,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:30,500 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2025-02-07 20:07:30,521 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2025-02-07 20:07:30,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2025-02-07 20:07:30,535 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 23 treesize of output 22 [2025-02-07 20:07:30,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 101 [2025-02-07 20:07:31,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2025-02-07 20:07:31,897 INFO L349 Elim1Store]: treesize reduction 471, result has 34.7 percent of original size [2025-02-07 20:07:31,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 20 new quantified variables, introduced 78 case distinctions, treesize of input 53697 treesize of output 42391 [2025-02-07 20:08:19,850 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 8 treesize of output 6 [2025-02-07 20:08:19,851 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 12 treesize of output 8 [2025-02-07 20:08:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:19,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:19,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:19,931 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 207 [2025-02-07 20:08:19,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:19,936 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 171 [2025-02-07 20:08:20,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:20,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1990 treesize of output 1631 [2025-02-07 20:08:20,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:20,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1622 treesize of output 1079 [2025-02-07 20:08:23,837 INFO L349 Elim1Store]: treesize reduction 1080, result has 44.0 percent of original size [2025-02-07 20:08:23,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 28 new quantified variables, introduced 171 case distinctions, treesize of input 68456819 treesize of output 60419098