./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-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/uthash-2.0.2/uthash_BER_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:45:02,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:45:02,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:45:02,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:45:02,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:45:02,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:45:02,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:45:02,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:45:02,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:45:02,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:45:02,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:45:02,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:45:02,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:45:02,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:45:02,372 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:45:02,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:45:02,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:45:02,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:45:02,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:45:02,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:45:02,374 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-08 04:45:02,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:45:02,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:45:02,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:45:02,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:45:02,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:45:02,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-02-08 04:45:04,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5375de8/3b687a739fc04cf59087edf54f07c3a5/FLAG83a53b612 [2025-02-08 04:45:04,493 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:45:04,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2025-02-08 04:45:04,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5375de8/3b687a739fc04cf59087edf54f07c3a5/FLAG83a53b612 [2025-02-08 04:45:04,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5375de8/3b687a739fc04cf59087edf54f07c3a5 [2025-02-08 04:45:04,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:45:04,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:45:04,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:45:04,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:45:04,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:45:04,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:45:04" (1/1) ... [2025-02-08 04:45:04,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fdd496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:04, skipping insertion in model container [2025-02-08 04:45:04,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:45:04" (1/1) ... [2025-02-08 04:45:04,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:45:05,097 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/uthash-2.0.2/uthash_BER_nondet_test2-1.i[37435,37448] [2025-02-08 04:45:05,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:45:05,233 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:45:05,279 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/uthash-2.0.2/uthash_BER_nondet_test2-1.i[37435,37448] [2025-02-08 04:45:05,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:45:05,384 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:45:05,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05 WrapperNode [2025-02-08 04:45:05,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:45:05,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:45:05,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:45:05,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:45:05,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,492 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1239 [2025-02-08 04:45:05,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:45:05,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:45:05,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:45:05,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:45:05,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,582 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-08 04:45:05,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:45:05,641 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:45:05,641 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:45:05,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:45:05,642 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (1/1) ... [2025-02-08 04:45:05,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:45:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:05,685 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-08 04:45:05,691 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-08 04:45:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:45:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:45:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:45:05,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:45:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:45:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:45:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:45:05,930 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:45:05,934 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:45:07,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:45:07,472 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-02-08 04:45:07,472 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:45:07,534 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:45:07,537 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:45:07,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:07 BoogieIcfgContainer [2025-02-08 04:45:07,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:45:07,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:45:07,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:45:07,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:45:07,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:45:04" (1/3) ... [2025-02-08 04:45:07,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc3c9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:07, skipping insertion in model container [2025-02-08 04:45:07,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:05" (2/3) ... [2025-02-08 04:45:07,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc3c9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:07, skipping insertion in model container [2025-02-08 04:45:07,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:07" (3/3) ... [2025-02-08 04:45:07,547 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2025-02-08 04:45:07,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:45:07,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test2-1.i that has 4 procedures, 369 locations, 1 initial locations, 33 loop locations, and 1 error locations. [2025-02-08 04:45:07,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:45:07,638 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;@e72f238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:45:07,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:45:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 361 states, 355 states have (on average 1.6169014084507043) internal successors, (574), 356 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 04:45:07,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:07,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:07,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:07,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash 857533540, now seen corresponding path program 1 times [2025-02-08 04:45:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413874603] [2025-02-08 04:45:07,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 04:45:07,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 04:45:07,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:07,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:07,821 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-08 04:45:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413874603] [2025-02-08 04:45:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413874603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:45:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536885093] [2025-02-08 04:45:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:45:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:07,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:45:07,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:45:07,853 INFO L87 Difference]: Start difference. First operand has 361 states, 355 states have (on average 1.6169014084507043) internal successors, (574), 356 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-08 04:45:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:08,023 INFO L93 Difference]: Finished difference Result 720 states and 1157 transitions. [2025-02-08 04:45:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:45:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-08 04:45:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:08,038 INFO L225 Difference]: With dead ends: 720 [2025-02-08 04:45:08,039 INFO L226 Difference]: Without dead ends: 357 [2025-02-08 04:45:08,044 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-08 04:45:08,046 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:08,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-08 04:45:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-08 04:45:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 520 transitions. [2025-02-08 04:45:08,115 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 520 transitions. Word has length 10 [2025-02-08 04:45:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:08,115 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 520 transitions. [2025-02-08 04:45:08,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-08 04:45:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 520 transitions. [2025-02-08 04:45:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 04:45:08,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:08,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:08,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:45:08,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash -147036178, now seen corresponding path program 1 times [2025-02-08 04:45:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:08,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475700794] [2025-02-08 04:45:08,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:08,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 04:45:08,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 04:45:08,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:08,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:08,624 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-08 04:45:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475700794] [2025-02-08 04:45:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475700794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:45:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622293507] [2025-02-08 04:45:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:08,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:45:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:08,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:45:08,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:45:08,632 INFO L87 Difference]: Start difference. First operand 357 states and 520 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-08 04:45:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:08,859 INFO L93 Difference]: Finished difference Result 472 states and 686 transitions. [2025-02-08 04:45:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:08,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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) Word has length 64 [2025-02-08 04:45:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:08,862 INFO L225 Difference]: With dead ends: 472 [2025-02-08 04:45:08,863 INFO L226 Difference]: Without dead ends: 315 [2025-02-08 04:45:08,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:45:08,865 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 12 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:08,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1517 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:45:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-08 04:45:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-02-08 04:45:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.4096774193548387) internal successors, (437), 310 states have internal predecessors, (437), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2025-02-08 04:45:08,888 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 64 [2025-02-08 04:45:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2025-02-08 04:45:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-08 04:45:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2025-02-08 04:45:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 04:45:08,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:08,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:08,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:45:08,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1135762892, now seen corresponding path program 1 times [2025-02-08 04:45:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:08,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330241630] [2025-02-08 04:45:08,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:08,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:08,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 04:45:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 04:45:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:09,501 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-08 04:45:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330241630] [2025-02-08 04:45:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330241630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:09,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:45:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973392661] [2025-02-08 04:45:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:09,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:09,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:09,502 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-08 04:45:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:09,784 INFO L93 Difference]: Finished difference Result 741 states and 1037 transitions. [2025-02-08 04:45:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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) Word has length 64 [2025-02-08 04:45:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:09,788 INFO L225 Difference]: With dead ends: 741 [2025-02-08 04:45:09,788 INFO L226 Difference]: Without dead ends: 623 [2025-02-08 04:45:09,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:09,789 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 424 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:09,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1562 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:45:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-08 04:45:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 317. [2025-02-08 04:45:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4070512820512822) internal successors, (439), 312 states have internal predecessors, (439), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2025-02-08 04:45:09,808 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 64 [2025-02-08 04:45:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:09,808 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2025-02-08 04:45:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-08 04:45:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2025-02-08 04:45:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-08 04:45:09,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:09,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:09,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:45:09,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:09,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 218566794, now seen corresponding path program 1 times [2025-02-08 04:45:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027694401] [2025-02-08 04:45:09,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:09,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 04:45:09,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 04:45:09,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027694401] [2025-02-08 04:45:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027694401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642196032] [2025-02-08 04:45:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:10,165 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-08 04:45:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:10,300 INFO L93 Difference]: Finished difference Result 588 states and 820 transitions. [2025-02-08 04:45:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 139 [2025-02-08 04:45:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:10,302 INFO L225 Difference]: With dead ends: 588 [2025-02-08 04:45:10,304 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 04:45:10,304 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-08 04:45:10,305 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 30 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:10,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 920 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 04:45:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-08 04:45:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 270 states have internal predecessors, (362), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 368 transitions. [2025-02-08 04:45:10,321 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 368 transitions. Word has length 139 [2025-02-08 04:45:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 368 transitions. [2025-02-08 04:45:10,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-08 04:45:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 368 transitions. [2025-02-08 04:45:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-08 04:45:10,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:10,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:45:10,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash 250302672, now seen corresponding path program 1 times [2025-02-08 04:45:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262449728] [2025-02-08 04:45:10,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:10,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 04:45:10,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 04:45:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:45:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262449728] [2025-02-08 04:45:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262449728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:45:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565627875] [2025-02-08 04:45:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:10,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:10,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:10,564 INFO L87 Difference]: Start difference. First operand 275 states and 368 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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-08 04:45:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:10,701 INFO L93 Difference]: Finished difference Result 726 states and 976 transitions. [2025-02-08 04:45:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:10,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2025-02-08 04:45:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:10,704 INFO L225 Difference]: With dead ends: 726 [2025-02-08 04:45:10,704 INFO L226 Difference]: Without dead ends: 455 [2025-02-08 04:45:10,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:10,705 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 176 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:10,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 747 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-08 04:45:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2025-02-08 04:45:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.3459821428571428) internal successors, (603), 448 states have internal predecessors, (603), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 609 transitions. [2025-02-08 04:45:10,721 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 609 transitions. Word has length 139 [2025-02-08 04:45:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 609 transitions. [2025-02-08 04:45:10,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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-08 04:45:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 609 transitions. [2025-02-08 04:45:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 04:45:10,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:10,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:10,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:45:10,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:10,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash 544894692, now seen corresponding path program 1 times [2025-02-08 04:45:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225436460] [2025-02-08 04:45:10,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 04:45:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 04:45:10,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:10,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225436460] [2025-02-08 04:45:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225436460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:45:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273035414] [2025-02-08 04:45:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:11,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:45:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:11,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:45:11,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:45:11,045 INFO L87 Difference]: Start difference. First operand 453 states and 609 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:11,438 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2025-02-08 04:45:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 04:45:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:11,444 INFO L225 Difference]: With dead ends: 894 [2025-02-08 04:45:11,444 INFO L226 Difference]: Without dead ends: 531 [2025-02-08 04:45:11,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:11,447 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1036 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:11,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 817 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:45:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-08 04:45:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 361. [2025-02-08 04:45:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.3398876404494382) internal successors, (477), 356 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 483 transitions. [2025-02-08 04:45:11,482 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 483 transitions. Word has length 154 [2025-02-08 04:45:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:11,483 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 483 transitions. [2025-02-08 04:45:11,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 483 transitions. [2025-02-08 04:45:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 04:45:11,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:11,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:45:11,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -710183118, now seen corresponding path program 1 times [2025-02-08 04:45:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407983079] [2025-02-08 04:45:11,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:11,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 04:45:11,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 04:45:11,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:11,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407983079] [2025-02-08 04:45:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407983079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273376229] [2025-02-08 04:45:12,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:12,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:12,170 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-08 04:45:12,173 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-08 04:45:12,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 04:45:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 04:45:12,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:12,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:12,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 04:45:12,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:12,620 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 11 treesize of output 7 [2025-02-08 04:45:12,646 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 16 treesize of output 17 [2025-02-08 04:45:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:13,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273376229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 04:45:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397268459] [2025-02-08 04:45:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:13,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:45:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:13,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:45:13,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:13,660 INFO L87 Difference]: Start difference. First operand 361 states and 483 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:15,384 INFO L93 Difference]: Finished difference Result 860 states and 1154 transitions. [2025-02-08 04:45:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:45:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2025-02-08 04:45:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:15,388 INFO L225 Difference]: With dead ends: 860 [2025-02-08 04:45:15,388 INFO L226 Difference]: Without dead ends: 542 [2025-02-08 04:45:15,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:45:15,390 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 465 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:15,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1665 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 04:45:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-08 04:45:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 361. [2025-02-08 04:45:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.3370786516853932) internal successors, (476), 356 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 482 transitions. [2025-02-08 04:45:15,417 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 482 transitions. Word has length 164 [2025-02-08 04:45:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:15,418 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 482 transitions. [2025-02-08 04:45:15,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 482 transitions. [2025-02-08 04:45:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 04:45:15,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:15,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:15,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:45:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:15,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1303419972, now seen corresponding path program 1 times [2025-02-08 04:45:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675778416] [2025-02-08 04:45:15,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:15,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 04:45:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 04:45:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675778416] [2025-02-08 04:45:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675778416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537662949] [2025-02-08 04:45:16,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:16,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:16,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:16,133 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-08 04:45:16,136 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-08 04:45:16,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 04:45:16,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 04:45:16,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:16,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:16,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 04:45:16,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:16,510 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 11 treesize of output 7 [2025-02-08 04:45:16,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 04:45:16,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 77 treesize of output 55 [2025-02-08 04:45:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:45:17,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537662949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 04:45:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234262183] [2025-02-08 04:45:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:45:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:17,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:45:17,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:45:17,166 INFO L87 Difference]: Start difference. First operand 361 states and 482 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:18,466 INFO L93 Difference]: Finished difference Result 657 states and 874 transitions. [2025-02-08 04:45:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:45:18,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-02-08 04:45:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:18,470 INFO L225 Difference]: With dead ends: 657 [2025-02-08 04:45:18,470 INFO L226 Difference]: Without dead ends: 542 [2025-02-08 04:45:18,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-08 04:45:18,471 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 353 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:18,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2407 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 04:45:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-08 04:45:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 397. [2025-02-08 04:45:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.316326530612245) internal successors, (516), 392 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 522 transitions. [2025-02-08 04:45:18,501 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 522 transitions. Word has length 165 [2025-02-08 04:45:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:18,501 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 522 transitions. [2025-02-08 04:45:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 522 transitions. [2025-02-08 04:45:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 04:45:18,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:18,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:18,518 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-08 04:45:18,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:18,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:18,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1099866858, now seen corresponding path program 1 times [2025-02-08 04:45:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601604471] [2025-02-08 04:45:18,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:18,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 04:45:18,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 04:45:18,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:18,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601604471] [2025-02-08 04:45:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601604471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534337961] [2025-02-08 04:45:19,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:19,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:19,187 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-08 04:45:19,190 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-08 04:45:19,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 04:45:19,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 04:45:19,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:19,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:19,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 04:45:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:45:19,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534337961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-08 04:45:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497048094] [2025-02-08 04:45:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:19,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:45:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:45:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:19,817 INFO L87 Difference]: Start difference. First operand 397 states and 522 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:20,062 INFO L93 Difference]: Finished difference Result 512 states and 676 transitions. [2025-02-08 04:45:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:20,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-02-08 04:45:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:20,065 INFO L225 Difference]: With dead ends: 512 [2025-02-08 04:45:20,065 INFO L226 Difference]: Without dead ends: 397 [2025-02-08 04:45:20,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:20,068 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 17 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:20,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1116 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:45:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-08 04:45:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-02-08 04:45:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.3137755102040816) internal successors, (515), 392 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 521 transitions. [2025-02-08 04:45:20,087 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 521 transitions. Word has length 166 [2025-02-08 04:45:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 521 transitions. [2025-02-08 04:45:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 521 transitions. [2025-02-08 04:45:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:45:20,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:20,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:20,103 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-08 04:45:20,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:20,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1953245657, now seen corresponding path program 1 times [2025-02-08 04:45:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549824833] [2025-02-08 04:45:20,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:20,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:45:20,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:45:20,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:20,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:45:20,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:20,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549824833] [2025-02-08 04:45:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549824833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887292470] [2025-02-08 04:45:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:20,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:20,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:20,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:20,694 INFO L87 Difference]: Start difference. First operand 397 states and 521 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:20,995 INFO L93 Difference]: Finished difference Result 515 states and 679 transitions. [2025-02-08 04:45:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 04:45:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:20,999 INFO L225 Difference]: With dead ends: 515 [2025-02-08 04:45:20,999 INFO L226 Difference]: Without dead ends: 400 [2025-02-08 04:45:21,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:21,001 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 8 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:21,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1340 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:45:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-08 04:45:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-08 04:45:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3113924050632912) internal successors, (518), 395 states have internal predecessors, (518), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 524 transitions. [2025-02-08 04:45:21,020 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 524 transitions. Word has length 167 [2025-02-08 04:45:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:21,021 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 524 transitions. [2025-02-08 04:45:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 524 transitions. [2025-02-08 04:45:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 04:45:21,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:21,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:45:21,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1369567538, now seen corresponding path program 1 times [2025-02-08 04:45:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930363004] [2025-02-08 04:45:21,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:45:21,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:45:21,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:21,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:45:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930363004] [2025-02-08 04:45:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930363004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:45:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766082850] [2025-02-08 04:45:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:21,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:21,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:21,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:21,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:21,410 INFO L87 Difference]: Start difference. First operand 400 states and 524 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:21,783 INFO L93 Difference]: Finished difference Result 523 states and 688 transitions. [2025-02-08 04:45:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:45:21,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-08 04:45:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:21,786 INFO L225 Difference]: With dead ends: 523 [2025-02-08 04:45:21,786 INFO L226 Difference]: Without dead ends: 405 [2025-02-08 04:45:21,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:21,790 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 12 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:21,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1586 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:45:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-08 04:45:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2025-02-08 04:45:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.3107769423558897) internal successors, (523), 399 states have internal predecessors, (523), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 529 transitions. [2025-02-08 04:45:21,812 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 529 transitions. Word has length 168 [2025-02-08 04:45:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:21,813 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 529 transitions. [2025-02-08 04:45:21,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 529 transitions. [2025-02-08 04:45:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 04:45:21,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:21,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:21,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:45:21,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:21,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2052374429, now seen corresponding path program 1 times [2025-02-08 04:45:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:21,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272921502] [2025-02-08 04:45:21,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:21,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:45:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:45:21,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272921502] [2025-02-08 04:45:22,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272921502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371675299] [2025-02-08 04:45:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:22,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:22,190 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-08 04:45:22,193 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-08 04:45:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:45:22,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:45:22,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:22,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:22,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 04:45:22,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:22,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371675299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 04:45:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070611779] [2025-02-08 04:45:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:22,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:22,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:22,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:22,650 INFO L87 Difference]: Start difference. First operand 404 states and 529 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:22,822 INFO L93 Difference]: Finished difference Result 765 states and 1009 transitions. [2025-02-08 04:45:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:22,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-08 04:45:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:22,826 INFO L225 Difference]: With dead ends: 765 [2025-02-08 04:45:22,826 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 04:45:22,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:22,828 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 17 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:22,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 845 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 04:45:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-08 04:45:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.305764411027569) internal successors, (521), 399 states have internal predecessors, (521), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 527 transitions. [2025-02-08 04:45:22,847 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 527 transitions. Word has length 168 [2025-02-08 04:45:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:22,847 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 527 transitions. [2025-02-08 04:45:22,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 527 transitions. [2025-02-08 04:45:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 04:45:22,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:22,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:22,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 04:45:23,050 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,SelfDestructingSolverStorable11 [2025-02-08 04:45:23,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:23,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1518037514, now seen corresponding path program 1 times [2025-02-08 04:45:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977397630] [2025-02-08 04:45:23,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:23,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 04:45:23,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 04:45:23,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977397630] [2025-02-08 04:45:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977397630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709059001] [2025-02-08 04:45:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:23,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:23,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:23,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:23,456 INFO L87 Difference]: Start difference. First operand 404 states and 527 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:23,736 INFO L93 Difference]: Finished difference Result 768 states and 1011 transitions. [2025-02-08 04:45:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-08 04:45:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:23,739 INFO L225 Difference]: With dead ends: 768 [2025-02-08 04:45:23,739 INFO L226 Difference]: Without dead ends: 410 [2025-02-08 04:45:23,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:23,741 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 8 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:23,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1102 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:45:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-08 04:45:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-02-08 04:45:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 405 states have (on average 1.3012345679012345) internal successors, (527), 405 states have internal predecessors, (527), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 533 transitions. [2025-02-08 04:45:23,764 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 533 transitions. Word has length 169 [2025-02-08 04:45:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:23,765 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 533 transitions. [2025-02-08 04:45:23,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 533 transitions. [2025-02-08 04:45:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 04:45:23,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:23,767 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:23,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:45:23,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:23,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -576888833, now seen corresponding path program 1 times [2025-02-08 04:45:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580824121] [2025-02-08 04:45:23,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:23,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:45:23,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:45:23,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:23,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580824121] [2025-02-08 04:45:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580824121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:24,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:24,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:45:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450675947] [2025-02-08 04:45:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:24,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:24,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:24,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:24,119 INFO L87 Difference]: Start difference. First operand 410 states and 533 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:24,497 INFO L93 Difference]: Finished difference Result 774 states and 1015 transitions. [2025-02-08 04:45:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:45:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-02-08 04:45:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:24,500 INFO L225 Difference]: With dead ends: 774 [2025-02-08 04:45:24,500 INFO L226 Difference]: Without dead ends: 420 [2025-02-08 04:45:24,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:24,501 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 12 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:24,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1580 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:45:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-08 04:45:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2025-02-08 04:45:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 1.3002421307506054) internal successors, (537), 413 states have internal predecessors, (537), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 543 transitions. [2025-02-08 04:45:24,517 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 543 transitions. Word has length 170 [2025-02-08 04:45:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 543 transitions. [2025-02-08 04:45:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 543 transitions. [2025-02-08 04:45:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 04:45:24,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:24,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:24,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:45:24,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:24,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -183992672, now seen corresponding path program 1 times [2025-02-08 04:45:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:24,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149342087] [2025-02-08 04:45:24,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:24,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:45:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:45:24,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:24,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149342087] [2025-02-08 04:45:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149342087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614071136] [2025-02-08 04:45:24,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:24,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:24,952 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-08 04:45:24,957 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-08 04:45:25,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:45:25,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:45:25,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:25,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:25,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 04:45:25,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:38,425 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 04:45:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:40,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614071136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:45:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237745600] [2025-02-08 04:45:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:40,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:40,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:40,312 INFO L87 Difference]: Start difference. First operand 418 states and 543 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:42,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:45:45,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:45:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:45,449 INFO L93 Difference]: Finished difference Result 786 states and 1030 transitions. [2025-02-08 04:45:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:45:45,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-02-08 04:45:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:45,452 INFO L225 Difference]: With dead ends: 786 [2025-02-08 04:45:45,452 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 04:45:45,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:45,455 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 12 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:45,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1586 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-08 04:45:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 04:45:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 418. [2025-02-08 04:45:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 1.3002421307506054) internal successors, (537), 413 states have internal predecessors, (537), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 543 transitions. [2025-02-08 04:45:45,472 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 543 transitions. Word has length 170 [2025-02-08 04:45:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 543 transitions. [2025-02-08 04:45:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 543 transitions. [2025-02-08 04:45:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 04:45:45,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:45,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:45,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 04:45:45,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 04:45:45,676 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:45,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 101451715, now seen corresponding path program 1 times [2025-02-08 04:45:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800820646] [2025-02-08 04:45:45,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:45,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 04:45:45,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 04:45:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800820646] [2025-02-08 04:45:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800820646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:46,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:46,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:45:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298707685] [2025-02-08 04:45:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:46,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:45:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:46,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:45:46,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:46,090 INFO L87 Difference]: Start difference. First operand 418 states and 543 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:46,582 INFO L93 Difference]: Finished difference Result 791 states and 1034 transitions. [2025-02-08 04:45:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:45:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 04:45:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:46,585 INFO L225 Difference]: With dead ends: 791 [2025-02-08 04:45:46,585 INFO L226 Difference]: Without dead ends: 438 [2025-02-08 04:45:46,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:46,587 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:46,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1675 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:45:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-08 04:45:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 432. [2025-02-08 04:45:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 427 states have (on average 1.2997658079625294) internal successors, (555), 427 states have internal predecessors, (555), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 561 transitions. [2025-02-08 04:45:46,605 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 561 transitions. Word has length 171 [2025-02-08 04:45:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:46,605 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 561 transitions. [2025-02-08 04:45:46,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 561 transitions. [2025-02-08 04:45:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 04:45:46,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:46,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:46,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:45:46,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:46,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -603669182, now seen corresponding path program 1 times [2025-02-08 04:45:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54031575] [2025-02-08 04:45:46,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:46,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 04:45:46,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 04:45:46,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:46,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54031575] [2025-02-08 04:45:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54031575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362267384] [2025-02-08 04:45:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:46,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:46,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:46,935 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:45:46,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 04:45:47,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 04:45:47,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 04:45:47,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:47,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:47,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 04:45:47,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:47,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362267384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:47,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:47,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:45:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508594972] [2025-02-08 04:45:47,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:47,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:47,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:47,542 INFO L87 Difference]: Start difference. First operand 432 states and 561 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:47,935 INFO L93 Difference]: Finished difference Result 802 states and 1049 transitions. [2025-02-08 04:45:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:45:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 04:45:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:47,938 INFO L225 Difference]: With dead ends: 802 [2025-02-08 04:45:47,938 INFO L226 Difference]: Without dead ends: 442 [2025-02-08 04:45:47,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:45:47,940 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 17 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:47,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1590 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:45:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-08 04:45:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2025-02-08 04:45:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.296983758700696) internal successors, (559), 431 states have internal predecessors, (559), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 565 transitions. [2025-02-08 04:45:47,963 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 565 transitions. Word has length 171 [2025-02-08 04:45:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:47,963 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 565 transitions. [2025-02-08 04:45:47,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 565 transitions. [2025-02-08 04:45:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 04:45:47,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:47,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:47,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 04:45:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 04:45:48,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1068706264, now seen corresponding path program 1 times [2025-02-08 04:45:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314849541] [2025-02-08 04:45:48,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:48,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:45:48,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:45:48,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:48,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:45:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314849541] [2025-02-08 04:45:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314849541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:48,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:48,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 04:45:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491586157] [2025-02-08 04:45:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:45:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:48,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:45:48,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 04:45:48,633 INFO L87 Difference]: Start difference. First operand 436 states and 565 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:49,307 INFO L93 Difference]: Finished difference Result 821 states and 1073 transitions. [2025-02-08 04:45:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:45:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-02-08 04:45:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:49,309 INFO L225 Difference]: With dead ends: 821 [2025-02-08 04:45:49,309 INFO L226 Difference]: Without dead ends: 454 [2025-02-08 04:45:49,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:45:49,310 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 23 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:49,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2406 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:45:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-08 04:45:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 442. [2025-02-08 04:45:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.2929061784897025) internal successors, (565), 437 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:45:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 571 transitions. [2025-02-08 04:45:49,325 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 571 transitions. Word has length 172 [2025-02-08 04:45:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 571 transitions. [2025-02-08 04:45:49,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:45:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 571 transitions. [2025-02-08 04:45:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 04:45:49,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:49,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:45:49,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 04:45:49,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -582621923, now seen corresponding path program 1 times [2025-02-08 04:45:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530746863] [2025-02-08 04:45:49,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:45:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:45:49,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:49,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:45:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530746863] [2025-02-08 04:45:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530746863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568866244] [2025-02-08 04:45:49,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:49,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:49,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:45:49,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 04:45:50,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:45:50,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:45:50,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:50,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:50,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-08 04:45:50,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:50,354 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 5 [2025-02-08 04:45:50,704 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 04:45:50,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 04:45:50,723 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 11 treesize of output 7 [2025-02-08 04:45:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:45:50,805 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 26 treesize of output 14 [2025-02-08 04:45:50,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 7 treesize of output 3 [2025-02-08 04:45:52,421 INFO L190 IndexEqualityManager]: detected not equals via solver