./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:19:06,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:19:06,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:19:06,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:19:06,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:19:06,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:19:06,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:19:06,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:19:06,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:19:06,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:19:06,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:19:06,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:19:06,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:19:06,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:19:06,145 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:19:06,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:19:06,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:06,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:06,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:06,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:19:06,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:19:06,147 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2025-01-09 04:19:06,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:19:06,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:19:06,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:19:06,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:19:06,371 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:19:06,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:07,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d825dceea/1c7431fc251e47eab07a8738efbe5a83/FLAGc8465a782 [2025-01-09 04:19:07,923 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:19:07,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:07,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d825dceea/1c7431fc251e47eab07a8738efbe5a83/FLAGc8465a782 [2025-01-09 04:19:08,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d825dceea/1c7431fc251e47eab07a8738efbe5a83 [2025-01-09 04:19:08,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:19:08,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:19:08,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:08,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:19:08,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:19:08,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08, skipping insertion in model container [2025-01-09 04:19:08,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:19:08,454 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2025-01-09 04:19:08,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:08,464 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:19:08,498 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2025-01-09 04:19:08,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:08,518 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:19:08,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08 WrapperNode [2025-01-09 04:19:08,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:08,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:08,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:19:08,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:19:08,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,582 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 424 [2025-01-09 04:19:08,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:08,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:19:08,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:19:08,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:19:08,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,619 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:19:08,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:19:08,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:19:08,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:19:08,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:19:08,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (1/1) ... [2025-01-09 04:19:08,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:08,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:19:08,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:19:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:19:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-01-09 04:19:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-01-09 04:19:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:19:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:19:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-01-09 04:19:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-01-09 04:19:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-01-09 04:19:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-01-09 04:19:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-01-09 04:19:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-01-09 04:19:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:19:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:19:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:19:08,804 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:19:08,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:19:09,313 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 04:19:09,314 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:19:09,322 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:19:09,323 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:19:09,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:09 BoogieIcfgContainer [2025-01-09 04:19:09,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:19:09,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:19:09,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:19:09,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:19:09,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:19:08" (1/3) ... [2025-01-09 04:19:09,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e04fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:09, skipping insertion in model container [2025-01-09 04:19:09,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:08" (2/3) ... [2025-01-09 04:19:09,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e04fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:09, skipping insertion in model container [2025-01-09 04:19:09,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:09" (3/3) ... [2025-01-09 04:19:09,330 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:09,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:19:09,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c that has 6 procedures, 173 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:19:09,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:19:09,388 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;@17326253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:19:09,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:19:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 134 states have (on average 1.5970149253731343) internal successors, (214), 138 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 04:19:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 04:19:09,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:09,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:09,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash -691145907, now seen corresponding path program 1 times [2025-01-09 04:19:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633243406] [2025-01-09 04:19:09,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:09,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:19:09,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:19:09,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:09,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633243406] [2025-01-09 04:19:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633243406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:09,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701542361] [2025-01-09 04:19:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:09,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:09,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:09,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:09,676 INFO L87 Difference]: Start difference. First operand has 173 states, 134 states have (on average 1.5970149253731343) internal successors, (214), 138 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:09,776 INFO L93 Difference]: Finished difference Result 349 states and 592 transitions. [2025-01-09 04:19:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:09,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 04:19:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:09,789 INFO L225 Difference]: With dead ends: 349 [2025-01-09 04:19:09,790 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 04:19:09,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:09,797 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 7 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:09,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 788 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 04:19:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 04:19:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 140 states have internal predecessors, (212), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 04:19:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 276 transitions. [2025-01-09 04:19:09,844 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 276 transitions. Word has length 15 [2025-01-09 04:19:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:09,844 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 276 transitions. [2025-01-09 04:19:09,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 276 transitions. [2025-01-09 04:19:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 04:19:09,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:09,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:19:09,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 816461711, now seen corresponding path program 1 times [2025-01-09 04:19:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510501436] [2025-01-09 04:19:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:09,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 04:19:09,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 04:19:09,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:09,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510501436] [2025-01-09 04:19:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510501436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673331594] [2025-01-09 04:19:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:09,923 INFO L87 Difference]: Start difference. First operand 176 states and 276 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:09,965 INFO L93 Difference]: Finished difference Result 363 states and 573 transitions. [2025-01-09 04:19:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:09,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 04:19:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:09,968 INFO L225 Difference]: With dead ends: 363 [2025-01-09 04:19:09,968 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 04:19:09,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:09,970 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 22 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:09,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 797 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 04:19:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-01-09 04:19:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2025-01-09 04:19:09,988 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 16 [2025-01-09 04:19:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2025-01-09 04:19:09,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2025-01-09 04:19:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 04:19:09,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:09,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:09,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:19:09,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:09,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 614188408, now seen corresponding path program 1 times [2025-01-09 04:19:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801605799] [2025-01-09 04:19:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 04:19:10,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 04:19:10,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801605799] [2025-01-09 04:19:10,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801605799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:10,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696403577] [2025-01-09 04:19:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:10,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:10,105 INFO L87 Difference]: Start difference. First operand 188 states and 291 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,168 INFO L93 Difference]: Finished difference Result 395 states and 619 transitions. [2025-01-09 04:19:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:10,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 04:19:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,171 INFO L225 Difference]: With dead ends: 395 [2025-01-09 04:19:10,171 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 04:19:10,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:10,172 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 22 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 534 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 04:19:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 190. [2025-01-09 04:19:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2025-01-09 04:19:10,190 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 22 [2025-01-09 04:19:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,190 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2025-01-09 04:19:10,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2025-01-09 04:19:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 04:19:10,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,193 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] [2025-01-09 04:19:10,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:19:10,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:10,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2053750860, now seen corresponding path program 1 times [2025-01-09 04:19:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511679547] [2025-01-09 04:19:10,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:19:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:19:10,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511679547] [2025-01-09 04:19:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511679547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:10,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848931596] [2025-01-09 04:19:10,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:10,290 INFO L87 Difference]: Start difference. First operand 190 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,332 INFO L93 Difference]: Finished difference Result 428 states and 676 transitions. [2025-01-09 04:19:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:10,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 04:19:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,335 INFO L225 Difference]: With dead ends: 428 [2025-01-09 04:19:10,335 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 04:19:10,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:10,336 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 119 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 789 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 04:19:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 190. [2025-01-09 04:19:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4966442953020134) internal successors, (223), 152 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 289 transitions. [2025-01-09 04:19:10,351 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 289 transitions. Word has length 31 [2025-01-09 04:19:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,351 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 289 transitions. [2025-01-09 04:19:10,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2025-01-09 04:19:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:19:10,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:19:10,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -966070591, now seen corresponding path program 1 times [2025-01-09 04:19:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501093166] [2025-01-09 04:19:10,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:19:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:19:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501093166] [2025-01-09 04:19:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501093166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:10,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937985822] [2025-01-09 04:19:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:10,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:10,424 INFO L87 Difference]: Start difference. First operand 190 states and 289 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,452 INFO L93 Difference]: Finished difference Result 371 states and 568 transitions. [2025-01-09 04:19:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:19:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,454 INFO L225 Difference]: With dead ends: 371 [2025-01-09 04:19:10,454 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 04:19:10,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:10,459 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 04:19:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-01-09 04:19:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 152 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2025-01-09 04:19:10,481 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 32 [2025-01-09 04:19:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2025-01-09 04:19:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2025-01-09 04:19:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:19:10,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:19:10,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1394705756, now seen corresponding path program 1 times [2025-01-09 04:19:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072679624] [2025-01-09 04:19:10,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:10,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072679624] [2025-01-09 04:19:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072679624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438470757] [2025-01-09 04:19:10,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:10,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:10,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:10,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:19:10,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:10,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:10,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:10,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438470757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:10,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 04:19:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953984943] [2025-01-09 04:19:10,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:10,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:10,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:10,802 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,859 INFO L93 Difference]: Finished difference Result 428 states and 663 transitions. [2025-01-09 04:19:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:10,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-01-09 04:19:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,861 INFO L225 Difference]: With dead ends: 428 [2025-01-09 04:19:10,861 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 04:19:10,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:10,862 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 91 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 783 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 04:19:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2025-01-09 04:19:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.4635416666666667) internal successors, (281), 195 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2025-01-09 04:19:10,882 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 34 [2025-01-09 04:19:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,882 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2025-01-09 04:19:10,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2025-01-09 04:19:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:10,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,886 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:10,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:19:11,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:11,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1807571708, now seen corresponding path program 2 times [2025-01-09 04:19:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494226930] [2025-01-09 04:19:11,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:19:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 04:19:11,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-01-09 04:19:11,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 04:19:11,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 04:19:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494226930] [2025-01-09 04:19:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494226930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317634782] [2025-01-09 04:19:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:11,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:11,154 INFO L87 Difference]: Start difference. First operand 243 states and 367 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,210 INFO L93 Difference]: Finished difference Result 456 states and 713 transitions. [2025-01-09 04:19:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,213 INFO L225 Difference]: With dead ends: 456 [2025-01-09 04:19:11,213 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 04:19:11,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:11,214 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 732 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 04:19:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-01-09 04:19:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.4607329842931938) internal successors, (279), 194 states have internal predecessors, (279), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 04:19:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 363 transitions. [2025-01-09 04:19:11,226 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 363 transitions. Word has length 56 [2025-01-09 04:19:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,226 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 363 transitions. [2025-01-09 04:19:11,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 363 transitions. [2025-01-09 04:19:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:11,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,227 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:11,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:19:11,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 931617973, now seen corresponding path program 1 times [2025-01-09 04:19:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645164377] [2025-01-09 04:19:11,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:19:11,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:19:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 04:19:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645164377] [2025-01-09 04:19:11,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645164377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671361849] [2025-01-09 04:19:11,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:11,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:11,294 INFO L87 Difference]: Start difference. First operand 241 states and 363 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,334 INFO L93 Difference]: Finished difference Result 461 states and 711 transitions. [2025-01-09 04:19:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:11,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,336 INFO L225 Difference]: With dead ends: 461 [2025-01-09 04:19:11,336 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 04:19:11,337 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-01-09 04:19:11,338 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 8 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 757 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 04:19:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-01-09 04:19:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 200 states have internal predecessors, (287), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 04:19:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 371 transitions. [2025-01-09 04:19:11,350 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 371 transitions. Word has length 56 [2025-01-09 04:19:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,350 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 371 transitions. [2025-01-09 04:19:11,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2025-01-09 04:19:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:19:11,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,354 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:19:11,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1233160945, now seen corresponding path program 1 times [2025-01-09 04:19:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021089639] [2025-01-09 04:19:11,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:19:11,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:19:11,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 04:19:11,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021089639] [2025-01-09 04:19:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021089639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414589492] [2025-01-09 04:19:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:11,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:11,428 INFO L87 Difference]: Start difference. First operand 248 states and 371 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,468 INFO L93 Difference]: Finished difference Result 505 states and 767 transitions. [2025-01-09 04:19:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-01-09 04:19:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,470 INFO L225 Difference]: With dead ends: 505 [2025-01-09 04:19:11,470 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 04:19:11,471 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-01-09 04:19:11,471 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 22 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 772 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 04:19:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2025-01-09 04:19:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 231 states have internal predecessors, (323), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 04:19:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2025-01-09 04:19:11,485 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 57 [2025-01-09 04:19:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2025-01-09 04:19:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2025-01-09 04:19:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:19:11,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:19:11,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2051960172, now seen corresponding path program 1 times [2025-01-09 04:19:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107925655] [2025-01-09 04:19:11,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:19:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:19:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107925655] [2025-01-09 04:19:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107925655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020800937] [2025-01-09 04:19:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:11,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:11,590 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,617 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2025-01-09 04:19:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-01-09 04:19:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,621 INFO L225 Difference]: With dead ends: 517 [2025-01-09 04:19:11,621 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 04:19:11,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:11,622 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1033 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 04:19:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2025-01-09 04:19:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 231 states have internal predecessors, (320), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 04:19:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2025-01-09 04:19:11,642 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 75 [2025-01-09 04:19:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,643 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2025-01-09 04:19:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2025-01-09 04:19:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:19:11,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,645 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:11,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:19:11,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -569139055, now seen corresponding path program 1 times [2025-01-09 04:19:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834159146] [2025-01-09 04:19:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:19:11,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:19:11,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 04:19:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834159146] [2025-01-09 04:19:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834159146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722807871] [2025-01-09 04:19:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:11,766 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,810 INFO L93 Difference]: Finished difference Result 504 states and 751 transitions. [2025-01-09 04:19:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-01-09 04:19:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,813 INFO L225 Difference]: With dead ends: 504 [2025-01-09 04:19:11,813 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 04:19:11,814 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-01-09 04:19:11,815 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 9 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 740 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 04:19:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-01-09 04:19:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 226 states have internal predecessors, (308), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 04:19:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 396 transitions. [2025-01-09 04:19:11,839 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 396 transitions. Word has length 103 [2025-01-09 04:19:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,839 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 396 transitions. [2025-01-09 04:19:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 396 transitions. [2025-01-09 04:19:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 04:19:11,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,842 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:19:11,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1588097179, now seen corresponding path program 1 times [2025-01-09 04:19:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632237605] [2025-01-09 04:19:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:19:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:19:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 04:19:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632237605] [2025-01-09 04:19:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632237605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586997039] [2025-01-09 04:19:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:11,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:11,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:19:12,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:19:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:19:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:12,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 04:19:12,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586997039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 04:19:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593199084] [2025-01-09 04:19:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:12,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:12,162 INFO L87 Difference]: Start difference. First operand 277 states and 396 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:12,209 INFO L93 Difference]: Finished difference Result 500 states and 730 transitions. [2025-01-09 04:19:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:12,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 133 [2025-01-09 04:19:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:12,212 INFO L225 Difference]: With dead ends: 500 [2025-01-09 04:19:12,212 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 04:19:12,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:12,214 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 32 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:12,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 697 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 04:19:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-01-09 04:19:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 212 states have internal predecessors, (287), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 369 transitions. [2025-01-09 04:19:12,227 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 369 transitions. Word has length 133 [2025-01-09 04:19:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:12,227 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 369 transitions. [2025-01-09 04:19:12,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 369 transitions. [2025-01-09 04:19:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:19:12,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:12,229 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:12,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:19:12,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:12,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -42358641, now seen corresponding path program 1 times [2025-01-09 04:19:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309793571] [2025-01-09 04:19:12,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:12,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:19:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:19:12,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-09 04:19:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309793571] [2025-01-09 04:19:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309793571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109641031] [2025-01-09 04:19:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:12,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:12,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:19:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:19:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:19:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:12,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 04:19:12,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:12,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109641031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:12,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 04:19:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228796800] [2025-01-09 04:19:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:12,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:12,656 INFO L87 Difference]: Start difference. First operand 260 states and 369 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:12,699 INFO L93 Difference]: Finished difference Result 466 states and 676 transitions. [2025-01-09 04:19:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 137 [2025-01-09 04:19:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:12,702 INFO L225 Difference]: With dead ends: 466 [2025-01-09 04:19:12,702 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 04:19:12,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:12,703 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 34 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:12,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 693 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 04:19:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-01-09 04:19:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 196 states have internal predecessors, (264), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 340 transitions. [2025-01-09 04:19:12,713 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 340 transitions. Word has length 137 [2025-01-09 04:19:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:12,713 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 340 transitions. [2025-01-09 04:19:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 340 transitions. [2025-01-09 04:19:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:19:12,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:12,714 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:12,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:12,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -896212890, now seen corresponding path program 1 times [2025-01-09 04:19:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332171216] [2025-01-09 04:19:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:12,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:19:12,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:19:12,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-01-09 04:19:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332171216] [2025-01-09 04:19:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332171216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083793806] [2025-01-09 04:19:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:12,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:12,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:19:13,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:19:13,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:19:13,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:13,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:13,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 04:19:13,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083793806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 04:19:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400788546] [2025-01-09 04:19:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:13,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:13,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:13,141 INFO L87 Difference]: Start difference. First operand 241 states and 340 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:13,189 INFO L93 Difference]: Finished difference Result 457 states and 659 transitions. [2025-01-09 04:19:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 140 [2025-01-09 04:19:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:13,191 INFO L225 Difference]: With dead ends: 457 [2025-01-09 04:19:13,191 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 04:19:13,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:13,192 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 31 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:13,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 705 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 04:19:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-01-09 04:19:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 220 states have (on average 1.3681818181818182) internal successors, (301), 223 states have internal predecessors, (301), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 383 transitions. [2025-01-09 04:19:13,203 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 383 transitions. Word has length 140 [2025-01-09 04:19:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 383 transitions. [2025-01-09 04:19:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 383 transitions. [2025-01-09 04:19:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:19:13,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:13,205 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:13,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:19:13,409 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,SelfDestructingSolverStorable13 [2025-01-09 04:19:13,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:13,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1514032408, now seen corresponding path program 2 times [2025-01-09 04:19:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461942045] [2025-01-09 04:19:13,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:19:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:13,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-01-09 04:19:13,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 140 statements. [2025-01-09 04:19:13,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 04:19:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 04:19:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461942045] [2025-01-09 04:19:13,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461942045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417064492] [2025-01-09 04:19:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:13,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:13,500 INFO L87 Difference]: Start difference. First operand 272 states and 383 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:13,535 INFO L93 Difference]: Finished difference Result 413 states and 596 transitions. [2025-01-09 04:19:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:13,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 140 [2025-01-09 04:19:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:13,537 INFO L225 Difference]: With dead ends: 413 [2025-01-09 04:19:13,537 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 04:19:13,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:13,538 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 3 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:13,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 749 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 04:19:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 04:19:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 223 states have (on average 1.3632286995515694) internal successors, (304), 226 states have internal predecessors, (304), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 386 transitions. [2025-01-09 04:19:13,549 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 386 transitions. Word has length 140 [2025-01-09 04:19:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:13,549 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 386 transitions. [2025-01-09 04:19:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 386 transitions. [2025-01-09 04:19:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:19:13,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:13,551 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:13,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:19:13,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1539651818, now seen corresponding path program 1 times [2025-01-09 04:19:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949057807] [2025-01-09 04:19:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:13,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:19:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:19:13,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-01-09 04:19:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949057807] [2025-01-09 04:19:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949057807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3796049] [2025-01-09 04:19:13,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:13,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:13,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:19:13,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:19:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:19:13,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:13,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:13,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:13,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 04:19:13,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3796049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:13,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 04:19:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926378389] [2025-01-09 04:19:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:13,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:13,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:13,819 INFO L87 Difference]: Start difference. First operand 276 states and 386 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:13,847 INFO L93 Difference]: Finished difference Result 422 states and 604 transitions. [2025-01-09 04:19:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 147 [2025-01-09 04:19:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:13,849 INFO L225 Difference]: With dead ends: 422 [2025-01-09 04:19:13,850 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 04:19:13,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:13,850 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 4 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:13,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 751 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 04:19:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-01-09 04:19:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 227 states have (on average 1.3568281938325992) internal successors, (308), 230 states have internal predecessors, (308), 41 states have call successors, (41), 12 states have call predecessors, (41), 12 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2025-01-09 04:19:13,860 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 147 [2025-01-09 04:19:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2025-01-09 04:19:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2025-01-09 04:19:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:19:13,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:13,861 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:13,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:14,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 04:19:14,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:14,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash -718421909, now seen corresponding path program 1 times [2025-01-09 04:19:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490845589] [2025-01-09 04:19:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:14,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:19:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:19:14,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 04:19:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490845589] [2025-01-09 04:19:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490845589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957120018] [2025-01-09 04:19:14,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:14,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:19:14,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:19:14,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:19:14,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:14,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 04:19:14,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957120018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 04:19:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494640335] [2025-01-09 04:19:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:14,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:14,346 INFO L87 Difference]: Start difference. First operand 281 states and 390 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:14,380 INFO L93 Difference]: Finished difference Result 426 states and 604 transitions. [2025-01-09 04:19:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 155 [2025-01-09 04:19:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:14,382 INFO L225 Difference]: With dead ends: 426 [2025-01-09 04:19:14,382 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 04:19:14,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:14,383 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:14,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 741 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 04:19:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-01-09 04:19:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 227 states have (on average 1.3436123348017621) internal successors, (305), 229 states have internal predecessors, (305), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 04:19:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2025-01-09 04:19:14,394 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 155 [2025-01-09 04:19:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:14,395 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2025-01-09 04:19:14,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2025-01-09 04:19:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:19:14,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:14,397 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:14,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:19:14,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 04:19:14,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 209833023, now seen corresponding path program 1 times [2025-01-09 04:19:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370204634] [2025-01-09 04:19:14,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:14,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:19:14,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:19:14,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 04:19:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370204634] [2025-01-09 04:19:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370204634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762309046] [2025-01-09 04:19:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:14,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:14,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:19:14,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:19:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:19:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:14,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-09 04:19:14,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762309046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:14,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:19:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433560288] [2025-01-09 04:19:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:14,887 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:14,899 INFO L93 Difference]: Finished difference Result 424 states and 593 transitions. [2025-01-09 04:19:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 162 [2025-01-09 04:19:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:14,901 INFO L225 Difference]: With dead ends: 424 [2025-01-09 04:19:14,901 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 04:19:14,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:14,902 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:14,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 04:19:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-01-09 04:19:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 227 states have (on average 1.3392070484581498) internal successors, (304), 228 states have internal predecessors, (304), 39 states have call successors, (39), 12 states have call predecessors, (39), 12 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 04:19:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 382 transitions. [2025-01-09 04:19:14,913 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 382 transitions. Word has length 162 [2025-01-09 04:19:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:14,914 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 382 transitions. [2025-01-09 04:19:14,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 382 transitions. [2025-01-09 04:19:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:19:14,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:14,916 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:14,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 04:19:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:15,118 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 574796215, now seen corresponding path program 1 times [2025-01-09 04:19:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322109324] [2025-01-09 04:19:15,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:15,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:19:15,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:19:15,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:15,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 04:19:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322109324] [2025-01-09 04:19:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322109324] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328231917] [2025-01-09 04:19:15,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:15,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:15,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:15,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:19:15,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:19:15,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:19:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:15,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 04:19:15,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-09 04:19:15,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328231917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:15,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:15,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 04:19:15,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161523098] [2025-01-09 04:19:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:15,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:15,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:15,451 INFO L87 Difference]: Start difference. First operand 279 states and 382 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 04:19:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:15,599 INFO L93 Difference]: Finished difference Result 631 states and 866 transitions. [2025-01-09 04:19:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:15,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 165 [2025-01-09 04:19:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:15,603 INFO L225 Difference]: With dead ends: 631 [2025-01-09 04:19:15,607 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 04:19:15,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:15,609 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 312 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 692 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 04:19:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 433. [2025-01-09 04:19:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 351 states have (on average 1.358974358974359) internal successors, (477), 353 states have internal predecessors, (477), 57 states have call successors, (57), 24 states have call predecessors, (57), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 04:19:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 591 transitions. [2025-01-09 04:19:15,638 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 591 transitions. Word has length 165 [2025-01-09 04:19:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:15,642 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 591 transitions. [2025-01-09 04:19:15,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 04:19:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 591 transitions. [2025-01-09 04:19:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 04:19:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:15,645 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:15,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:15,846 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -172936188, now seen corresponding path program 1 times [2025-01-09 04:19:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246547159] [2025-01-09 04:19:15,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:15,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 04:19:15,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 04:19:15,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:15,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246547159] [2025-01-09 04:19:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246547159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820267831] [2025-01-09 04:19:15,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:15,969 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:15,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:19:16,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 04:19:16,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 04:19:16,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:16,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:16,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-09 04:19:16,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820267831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 04:19:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481081806] [2025-01-09 04:19:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:16,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:16,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:16,156 INFO L87 Difference]: Start difference. First operand 433 states and 591 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:16,225 INFO L93 Difference]: Finished difference Result 674 states and 939 transitions. [2025-01-09 04:19:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:16,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 192 [2025-01-09 04:19:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:16,228 INFO L225 Difference]: With dead ends: 674 [2025-01-09 04:19:16,228 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 04:19:16,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:16,230 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 31 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:16,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 676 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 04:19:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-01-09 04:19:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 351 states have (on average 1.3418803418803418) internal successors, (471), 353 states have internal predecessors, (471), 57 states have call successors, (57), 24 states have call predecessors, (57), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 04:19:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 585 transitions. [2025-01-09 04:19:16,243 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 585 transitions. Word has length 192 [2025-01-09 04:19:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:16,244 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 585 transitions. [2025-01-09 04:19:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 585 transitions. [2025-01-09 04:19:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 04:19:16,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:16,246 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:16,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:16,447 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2039742355, now seen corresponding path program 1 times [2025-01-09 04:19:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696610800] [2025-01-09 04:19:16,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:16,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 04:19:16,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 04:19:16,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696610800] [2025-01-09 04:19:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696610800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113336631] [2025-01-09 04:19:16,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:16,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:16,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:16,591 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 04:19:16,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 04:19:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 04:19:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:16,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:16,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 04:19:16,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113336631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 04:19:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294846018] [2025-01-09 04:19:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:16,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:16,823 INFO L87 Difference]: Start difference. First operand 433 states and 585 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:16,900 INFO L93 Difference]: Finished difference Result 674 states and 925 transitions. [2025-01-09 04:19:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 193 [2025-01-09 04:19:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:16,905 INFO L225 Difference]: With dead ends: 674 [2025-01-09 04:19:16,905 INFO L226 Difference]: Without dead ends: 445 [2025-01-09 04:19:16,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:16,906 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 7 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:16,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 684 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-01-09 04:19:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-01-09 04:19:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 361 states have (on average 1.3434903047091413) internal successors, (485), 363 states have internal predecessors, (485), 57 states have call successors, (57), 26 states have call predecessors, (57), 26 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 04:19:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 599 transitions. [2025-01-09 04:19:16,930 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 599 transitions. Word has length 193 [2025-01-09 04:19:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:16,931 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 599 transitions. [2025-01-09 04:19:16,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 599 transitions. [2025-01-09 04:19:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 04:19:16,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:16,934 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:16,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 04:19:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:17,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1557276642, now seen corresponding path program 1 times [2025-01-09 04:19:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352411096] [2025-01-09 04:19:17,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:17,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 04:19:17,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 04:19:17,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:17,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352411096] [2025-01-09 04:19:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352411096] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485838598] [2025-01-09 04:19:17,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:17,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:17,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 04:19:17,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 04:19:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 04:19:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:17,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:19:17,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-01-09 04:19:17,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485838598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:19:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451072681] [2025-01-09 04:19:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:17,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:17,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:17,472 INFO L87 Difference]: Start difference. First operand 445 states and 599 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:17,499 INFO L93 Difference]: Finished difference Result 942 states and 1291 transitions. [2025-01-09 04:19:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 194 [2025-01-09 04:19:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:17,502 INFO L225 Difference]: With dead ends: 942 [2025-01-09 04:19:17,502 INFO L226 Difference]: Without dead ends: 701 [2025-01-09 04:19:17,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:17,504 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 159 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:17,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 511 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-01-09 04:19:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 526. [2025-01-09 04:19:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 432 states have (on average 1.3472222222222223) internal successors, (582), 435 states have internal predecessors, (582), 62 states have call successors, (62), 31 states have call predecessors, (62), 31 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 04:19:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 706 transitions. [2025-01-09 04:19:17,525 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 706 transitions. Word has length 194 [2025-01-09 04:19:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 706 transitions. [2025-01-09 04:19:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 706 transitions. [2025-01-09 04:19:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 04:19:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:17,527 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:17,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 04:19:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 04:19:17,728 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1919144751, now seen corresponding path program 1 times [2025-01-09 04:19:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113466944] [2025-01-09 04:19:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:17,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 04:19:17,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 04:19:17,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:17,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113466944] [2025-01-09 04:19:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113466944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328716821] [2025-01-09 04:19:17,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:17,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:17,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:17,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 04:19:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 04:19:18,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 04:19:18,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:19:18,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-09 04:19:18,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328716821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:19:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115438577] [2025-01-09 04:19:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:18,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:18,106 INFO L87 Difference]: Start difference. First operand 526 states and 706 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:18,173 INFO L93 Difference]: Finished difference Result 1118 states and 1526 transitions. [2025-01-09 04:19:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 195 [2025-01-09 04:19:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:18,178 INFO L225 Difference]: With dead ends: 1118 [2025-01-09 04:19:18,178 INFO L226 Difference]: Without dead ends: 826 [2025-01-09 04:19:18,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:18,180 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 163 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:18,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 528 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-01-09 04:19:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 638. [2025-01-09 04:19:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 532 states have (on average 1.3533834586466165) internal successors, (720), 537 states have internal predecessors, (720), 68 states have call successors, (68), 37 states have call predecessors, (68), 37 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 04:19:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 856 transitions. [2025-01-09 04:19:18,202 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 856 transitions. Word has length 195 [2025-01-09 04:19:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:18,203 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 856 transitions. [2025-01-09 04:19:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 856 transitions. [2025-01-09 04:19:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 04:19:18,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:18,205 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:18,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:18,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:18,407 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:18,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1148449063, now seen corresponding path program 1 times [2025-01-09 04:19:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738473342] [2025-01-09 04:19:18,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:18,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 04:19:18,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 04:19:18,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738473342] [2025-01-09 04:19:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738473342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684846256] [2025-01-09 04:19:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:18,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:18,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:18,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:18,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 04:19:18,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 04:19:18,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 04:19:18,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:18,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:19:18,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-01-09 04:19:18,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684846256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:18,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:19:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675235253] [2025-01-09 04:19:18,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:18,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:18,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:18,686 INFO L87 Difference]: Start difference. First operand 638 states and 856 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:18,720 INFO L93 Difference]: Finished difference Result 1338 states and 1828 transitions. [2025-01-09 04:19:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 196 [2025-01-09 04:19:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:18,725 INFO L225 Difference]: With dead ends: 1338 [2025-01-09 04:19:18,725 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 04:19:18,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:18,726 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 170 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:18,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 544 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 04:19:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 752. [2025-01-09 04:19:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 638 states have (on average 1.3667711598746082) internal successors, (872), 647 states have internal predecessors, (872), 72 states have call successors, (72), 41 states have call predecessors, (72), 41 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 04:19:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1016 transitions. [2025-01-09 04:19:18,750 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1016 transitions. Word has length 196 [2025-01-09 04:19:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:18,750 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1016 transitions. [2025-01-09 04:19:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1016 transitions. [2025-01-09 04:19:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 04:19:18,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:18,752 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:18,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 04:19:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:18,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 902534935, now seen corresponding path program 1 times [2025-01-09 04:19:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620359455] [2025-01-09 04:19:18,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:18,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 04:19:18,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 04:19:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-09 04:19:19,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620359455] [2025-01-09 04:19:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620359455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678237832] [2025-01-09 04:19:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:19,031 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:19,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 04:19:19,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 04:19:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 04:19:19,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:19,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 04:19:19,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 04:19:19,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678237832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:19,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-09 04:19:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994465316] [2025-01-09 04:19:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:19,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:19,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:19,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:19,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:19,209 INFO L87 Difference]: Start difference. First operand 752 states and 1016 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:19,240 INFO L93 Difference]: Finished difference Result 1351 states and 1835 transitions. [2025-01-09 04:19:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 196 [2025-01-09 04:19:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:19,244 INFO L225 Difference]: With dead ends: 1351 [2025-01-09 04:19:19,244 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 04:19:19,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 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-01-09 04:19:19,246 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:19,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 987 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 04:19:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2025-01-09 04:19:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 638 states have (on average 1.3573667711598747) internal successors, (866), 647 states have internal predecessors, (866), 72 states have call successors, (72), 41 states have call predecessors, (72), 41 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 04:19:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1010 transitions. [2025-01-09 04:19:19,270 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1010 transitions. Word has length 196 [2025-01-09 04:19:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:19,270 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1010 transitions. [2025-01-09 04:19:19,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1010 transitions. [2025-01-09 04:19:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 04:19:19,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:19,273 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:19,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 04:19:19,477 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 559820469, now seen corresponding path program 1 times [2025-01-09 04:19:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315098221] [2025-01-09 04:19:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:19,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 04:19:19,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 04:19:19,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:19,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 04:19:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315098221] [2025-01-09 04:19:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315098221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935390973] [2025-01-09 04:19:19,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:19,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:19,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:19,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 04:19:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 04:19:19,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 04:19:19,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:19,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:19,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:19,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 127 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 04:19:19,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-09 04:19:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935390973] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:19:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-01-09 04:19:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274773396] [2025-01-09 04:19:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:19,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:19,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:19,857 INFO L87 Difference]: Start difference. First operand 752 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 04:19:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:19,898 INFO L93 Difference]: Finished difference Result 1372 states and 1858 transitions. [2025-01-09 04:19:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 202 [2025-01-09 04:19:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:19,902 INFO L225 Difference]: With dead ends: 1372 [2025-01-09 04:19:19,902 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 04:19:19,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:19,903 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 34 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:19,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 463 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 04:19:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-01-09 04:19:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 632 states have (on average 1.3465189873417722) internal successors, (851), 641 states have internal predecessors, (851), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 989 transitions. [2025-01-09 04:19:19,932 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 989 transitions. Word has length 202 [2025-01-09 04:19:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:19,932 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 989 transitions. [2025-01-09 04:19:19,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 04:19:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 989 transitions. [2025-01-09 04:19:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 04:19:19,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:19,934 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:19,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 04:19:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 04:19:20,139 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:20,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1469445214, now seen corresponding path program 1 times [2025-01-09 04:19:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520316609] [2025-01-09 04:19:20,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 04:19:20,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 04:19:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-01-09 04:19:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520316609] [2025-01-09 04:19:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520316609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007599749] [2025-01-09 04:19:20,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:20,241 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:20,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 04:19:20,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 04:19:20,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 04:19:20,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:20,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:20,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 04:19:20,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 04:19:20,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007599749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-01-09 04:19:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19526999] [2025-01-09 04:19:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:20,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:20,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:20,417 INFO L87 Difference]: Start difference. First operand 743 states and 989 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:20,450 INFO L93 Difference]: Finished difference Result 1380 states and 1851 transitions. [2025-01-09 04:19:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 226 [2025-01-09 04:19:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:20,453 INFO L225 Difference]: With dead ends: 1380 [2025-01-09 04:19:20,453 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 04:19:20,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:20,455 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:20,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 984 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 04:19:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-01-09 04:19:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 632 states have (on average 1.3417721518987342) internal successors, (848), 641 states have internal predecessors, (848), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 986 transitions. [2025-01-09 04:19:20,481 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 986 transitions. Word has length 226 [2025-01-09 04:19:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:20,482 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 986 transitions. [2025-01-09 04:19:20,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 986 transitions. [2025-01-09 04:19:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 04:19:20,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:20,484 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:20,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 04:19:20,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:20,688 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash -548649419, now seen corresponding path program 1 times [2025-01-09 04:19:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146454824] [2025-01-09 04:19:20,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:20,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 04:19:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 04:19:20,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:20,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 81 proven. 72 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 04:19:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146454824] [2025-01-09 04:19:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146454824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357476839] [2025-01-09 04:19:20,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:20,846 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 04:19:20,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 04:19:21,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 04:19:21,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:21,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:21,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 255 proven. 9 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-01-09 04:19:21,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 90 proven. 63 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 04:19:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357476839] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:21,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 04:19:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194633214] [2025-01-09 04:19:21,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:21,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:21,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:21,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:21,175 INFO L87 Difference]: Start difference. First operand 743 states and 986 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:19:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:21,224 INFO L93 Difference]: Finished difference Result 1416 states and 1892 transitions. [2025-01-09 04:19:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:21,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 231 [2025-01-09 04:19:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:21,227 INFO L225 Difference]: With dead ends: 1416 [2025-01-09 04:19:21,228 INFO L226 Difference]: Without dead ends: 740 [2025-01-09 04:19:21,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:21,229 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 45 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:21,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 454 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-01-09 04:19:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2025-01-09 04:19:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 629 states have (on average 1.3386327503974562) internal successors, (842), 638 states have internal predecessors, (842), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 980 transitions. [2025-01-09 04:19:21,248 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 980 transitions. Word has length 231 [2025-01-09 04:19:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:21,249 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 980 transitions. [2025-01-09 04:19:21,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:19:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 980 transitions. [2025-01-09 04:19:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-09 04:19:21,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:21,251 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:21,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-09 04:19:21,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 04:19:21,451 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1634444667, now seen corresponding path program 1 times [2025-01-09 04:19:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985248842] [2025-01-09 04:19:21,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:21,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-09 04:19:21,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-09 04:19:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:21,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985248842] [2025-01-09 04:19:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985248842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:21,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671382159] [2025-01-09 04:19:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:21,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:21,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:21,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:21,662 INFO L87 Difference]: Start difference. First operand 740 states and 980 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:21,681 INFO L93 Difference]: Finished difference Result 1214 states and 1638 transitions. [2025-01-09 04:19:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2025-01-09 04:19:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:21,686 INFO L225 Difference]: With dead ends: 1214 [2025-01-09 04:19:21,686 INFO L226 Difference]: Without dead ends: 719 [2025-01-09 04:19:21,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:21,690 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:21,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-01-09 04:19:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2025-01-09 04:19:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 609 states have (on average 1.3218390804597702) internal successors, (805), 617 states have internal predecessors, (805), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 04:19:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 942 transitions. [2025-01-09 04:19:21,710 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 942 transitions. Word has length 258 [2025-01-09 04:19:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:21,711 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 942 transitions. [2025-01-09 04:19:21,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 942 transitions. [2025-01-09 04:19:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 04:19:21,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:21,712 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:21,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:19:21,713 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:21,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1147041801, now seen corresponding path program 1 times [2025-01-09 04:19:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447222307] [2025-01-09 04:19:21,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:21,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 04:19:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 04:19:21,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:21,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447222307] [2025-01-09 04:19:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447222307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:22,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168720156] [2025-01-09 04:19:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:22,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:22,062 INFO L87 Difference]: Start difference. First operand 719 states and 942 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 04:19:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,125 INFO L93 Difference]: Finished difference Result 1041 states and 1436 transitions. [2025-01-09 04:19:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:19:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 259 [2025-01-09 04:19:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,130 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 04:19:22,130 INFO L226 Difference]: Without dead ends: 1039 [2025-01-09 04:19:22,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:22,131 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 120 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1751 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-01-09 04:19:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 725. [2025-01-09 04:19:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 613 states have (on average 1.3197389885807504) internal successors, (809), 622 states have internal predecessors, (809), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 948 transitions. [2025-01-09 04:19:22,158 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 948 transitions. Word has length 259 [2025-01-09 04:19:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,159 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 948 transitions. [2025-01-09 04:19:22,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 04:19:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 948 transitions. [2025-01-09 04:19:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 04:19:22,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,161 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:19:22,161 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 145990938, now seen corresponding path program 1 times [2025-01-09 04:19:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180152611] [2025-01-09 04:19:22,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 04:19:22,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 04:19:22,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 04:19:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180152611] [2025-01-09 04:19:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180152611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401326609] [2025-01-09 04:19:22,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:22,422 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:22,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 04:19:22,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 04:19:22,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 04:19:22,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 04:19:22,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 248 proven. 33 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-01-09 04:19:22,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 04:19:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401326609] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:23,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-01-09 04:19:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219181047] [2025-01-09 04:19:23,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:19:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:19:23,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:23,060 INFO L87 Difference]: Start difference. First operand 725 states and 948 transitions. Second operand has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-01-09 04:19:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,477 INFO L93 Difference]: Finished difference Result 1745 states and 2360 transitions. [2025-01-09 04:19:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 267 [2025-01-09 04:19:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,483 INFO L225 Difference]: With dead ends: 1745 [2025-01-09 04:19:23,483 INFO L226 Difference]: Without dead ends: 1285 [2025-01-09 04:19:23,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 525 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:19:23,486 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 280 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 4524 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:19:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-01-09 04:19:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1007. [2025-01-09 04:19:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 855 states have (on average 1.312280701754386) internal successors, (1122), 865 states have internal predecessors, (1122), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2025-01-09 04:19:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1314 transitions. [2025-01-09 04:19:23,526 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1314 transitions. Word has length 267 [2025-01-09 04:19:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:23,526 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1314 transitions. [2025-01-09 04:19:23,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-01-09 04:19:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1314 transitions. [2025-01-09 04:19:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 04:19:23,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:23,529 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:23,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 04:19:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:23,730 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1107604955, now seen corresponding path program 1 times [2025-01-09 04:19:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878966777] [2025-01-09 04:19:23,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 04:19:23,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 04:19:23,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-01-09 04:19:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878966777] [2025-01-09 04:19:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878966777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166606004] [2025-01-09 04:19:23,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:23,832 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 04:19:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 04:19:23,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 04:19:23,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-01-09 04:19:24,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166606004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:19:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456780230] [2025-01-09 04:19:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:24,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:24,020 INFO L87 Difference]: Start difference. First operand 1007 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 04:19:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,087 INFO L93 Difference]: Finished difference Result 1880 states and 2495 transitions. [2025-01-09 04:19:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:24,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 267 [2025-01-09 04:19:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,093 INFO L225 Difference]: With dead ends: 1880 [2025-01-09 04:19:24,093 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 04:19:24,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,096 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 672 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 04:19:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 04:19:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 844 states have (on average 1.3009478672985781) internal successors, (1098), 854 states have internal predecessors, (1098), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2025-01-09 04:19:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1281 transitions. [2025-01-09 04:19:24,139 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1281 transitions. Word has length 267 [2025-01-09 04:19:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,139 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1281 transitions. [2025-01-09 04:19:24,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 04:19:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1281 transitions. [2025-01-09 04:19:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 04:19:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,144 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-09 04:19:24,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:24,345 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash -983712800, now seen corresponding path program 1 times [2025-01-09 04:19:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121232230] [2025-01-09 04:19:24,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 04:19:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 04:19:24,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-01-09 04:19:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121232230] [2025-01-09 04:19:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121232230] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441825739] [2025-01-09 04:19:24,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:24,472 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:24,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 04:19:24,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 04:19:24,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 04:19:24,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:24,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 04:19:24,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441825739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:19:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55597320] [2025-01-09 04:19:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:24,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:24,667 INFO L87 Difference]: Start difference. First operand 991 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,724 INFO L93 Difference]: Finished difference Result 1722 states and 2266 transitions. [2025-01-09 04:19:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 270 [2025-01-09 04:19:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,728 INFO L225 Difference]: With dead ends: 1722 [2025-01-09 04:19:24,728 INFO L226 Difference]: Without dead ends: 840 [2025-01-09 04:19:24,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,730 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 700 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-01-09 04:19:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2025-01-09 04:19:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 711 states have (on average 1.2967651195499297) internal successors, (922), 721 states have internal predecessors, (922), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 04:19:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1083 transitions. [2025-01-09 04:19:24,761 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1083 transitions. Word has length 270 [2025-01-09 04:19:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,761 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1083 transitions. [2025-01-09 04:19:24,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1083 transitions. [2025-01-09 04:19:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-09 04:19:24,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,763 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:24,964 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash -619161033, now seen corresponding path program 1 times [2025-01-09 04:19:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951942607] [2025-01-09 04:19:24,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 04:19:25,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 04:19:25,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2025-01-09 04:19:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951942607] [2025-01-09 04:19:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951942607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566222236] [2025-01-09 04:19:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:25,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:25,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 04:19:25,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 04:19:25,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 04:19:25,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:19:25,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 04:19:25,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566222236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-01-09 04:19:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102827551] [2025-01-09 04:19:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:25,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:25,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:19:25,540 INFO L87 Difference]: Start difference. First operand 840 states and 1083 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:25,770 INFO L93 Difference]: Finished difference Result 1757 states and 2275 transitions. [2025-01-09 04:19:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:19:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 282 [2025-01-09 04:19:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:25,775 INFO L225 Difference]: With dead ends: 1757 [2025-01-09 04:19:25,775 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 04:19:25,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:25,777 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 127 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1788 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 04:19:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1168. [2025-01-09 04:19:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 989 states have (on average 1.275025278058645) internal successors, (1261), 1001 states have internal predecessors, (1261), 116 states have call successors, (116), 63 states have call predecessors, (116), 62 states have return successors, (115), 110 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 04:19:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1492 transitions. [2025-01-09 04:19:25,813 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1492 transitions. Word has length 282 [2025-01-09 04:19:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1492 transitions. [2025-01-09 04:19:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1492 transitions. [2025-01-09 04:19:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-09 04:19:25,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:25,815 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:25,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-09 04:19:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 04:19:26,016 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1841744306, now seen corresponding path program 1 times [2025-01-09 04:19:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279155113] [2025-01-09 04:19:26,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-01-09 04:19:26,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-01-09 04:19:26,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 04:19:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279155113] [2025-01-09 04:19:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279155113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669002698] [2025-01-09 04:19:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:26,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:26,161 INFO L87 Difference]: Start difference. First operand 1168 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,236 INFO L93 Difference]: Finished difference Result 2356 states and 3023 transitions. [2025-01-09 04:19:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:26,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 284 [2025-01-09 04:19:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,241 INFO L225 Difference]: With dead ends: 2356 [2025-01-09 04:19:26,241 INFO L226 Difference]: Without dead ends: 1450 [2025-01-09 04:19:26,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:26,243 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 301 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 700 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-01-09 04:19:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1268. [2025-01-09 04:19:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1061 states have (on average 1.2648444863336474) internal successors, (1342), 1075 states have internal predecessors, (1342), 134 states have call successors, (134), 73 states have call predecessors, (134), 72 states have return successors, (133), 126 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 04:19:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1609 transitions. [2025-01-09 04:19:26,287 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1609 transitions. Word has length 284 [2025-01-09 04:19:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,287 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1609 transitions. [2025-01-09 04:19:26,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1609 transitions. [2025-01-09 04:19:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 04:19:26,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,289 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:19:26,289 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 872993812, now seen corresponding path program 1 times [2025-01-09 04:19:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956581835] [2025-01-09 04:19:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 04:19:26,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 04:19:26,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-01-09 04:19:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956581835] [2025-01-09 04:19:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956581835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813940817] [2025-01-09 04:19:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:26,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:26,415 INFO L87 Difference]: Start difference. First operand 1268 states and 1609 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,531 INFO L93 Difference]: Finished difference Result 2313 states and 3024 transitions. [2025-01-09 04:19:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:19:26,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 288 [2025-01-09 04:19:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,537 INFO L225 Difference]: With dead ends: 2313 [2025-01-09 04:19:26,537 INFO L226 Difference]: Without dead ends: 1388 [2025-01-09 04:19:26,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:26,539 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 42 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 739 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-01-09 04:19:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1350. [2025-01-09 04:19:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1125 states have (on average 1.2764444444444445) internal successors, (1436), 1139 states have internal predecessors, (1436), 152 states have call successors, (152), 73 states have call predecessors, (152), 72 states have return successors, (151), 144 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 04:19:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1739 transitions. [2025-01-09 04:19:26,613 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1739 transitions. Word has length 288 [2025-01-09 04:19:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,614 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1739 transitions. [2025-01-09 04:19:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1739 transitions. [2025-01-09 04:19:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 04:19:26,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,616 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:19:26,616 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -957421168, now seen corresponding path program 1 times [2025-01-09 04:19:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333738603] [2025-01-09 04:19:26,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 04:19:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 04:19:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-01-09 04:19:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333738603] [2025-01-09 04:19:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333738603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685352209] [2025-01-09 04:19:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:26,830 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:26,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-09 04:19:26,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 04:19:27,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 04:19:27,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:27,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:19:27,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 04:19:27,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685352209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 11 [2025-01-09 04:19:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861954344] [2025-01-09 04:19:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:19:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:27,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:19:27,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:27,112 INFO L87 Difference]: Start difference. First operand 1350 states and 1739 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:27,536 INFO L93 Difference]: Finished difference Result 3015 states and 3898 transitions. [2025-01-09 04:19:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 288 [2025-01-09 04:19:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:27,544 INFO L225 Difference]: With dead ends: 3015 [2025-01-09 04:19:27,544 INFO L226 Difference]: Without dead ends: 2009 [2025-01-09 04:19:27,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:19:27,547 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 594 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:27,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2190 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:19:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2025-01-09 04:19:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1470. [2025-01-09 04:19:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1226 states have (on average 1.2699836867862968) internal successors, (1557), 1241 states have internal predecessors, (1557), 166 states have call successors, (166), 78 states have call predecessors, (166), 77 states have return successors, (165), 157 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 04:19:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1888 transitions. [2025-01-09 04:19:27,656 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1888 transitions. Word has length 288 [2025-01-09 04:19:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:27,656 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 1888 transitions. [2025-01-09 04:19:27,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1888 transitions. [2025-01-09 04:19:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 04:19:27,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:27,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:27,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 04:19:27,859 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -70366320, now seen corresponding path program 1 times [2025-01-09 04:19:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:27,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420270398] [2025-01-09 04:19:27,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:27,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 04:19:27,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 04:19:27,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-01-09 04:19:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420270398] [2025-01-09 04:19:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420270398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146854926] [2025-01-09 04:19:28,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:28,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:28,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:28,376 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:28,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-09 04:19:28,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 04:19:28,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 04:19:28,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:28,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:28,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:19:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-01-09 04:19:28,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:28,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146854926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:28,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2025-01-09 04:19:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269210802] [2025-01-09 04:19:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:28,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:28,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:28,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:28,635 INFO L87 Difference]: Start difference. First operand 1470 states and 1888 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:28,876 INFO L93 Difference]: Finished difference Result 2688 states and 3476 transitions. [2025-01-09 04:19:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:19:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 288 [2025-01-09 04:19:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:28,886 INFO L225 Difference]: With dead ends: 2688 [2025-01-09 04:19:28,886 INFO L226 Difference]: Without dead ends: 1559 [2025-01-09 04:19:28,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:19:28,890 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 120 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:28,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1680 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-01-09 04:19:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1440. [2025-01-09 04:19:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1204 states have (on average 1.2641196013289036) internal successors, (1522), 1219 states have internal predecessors, (1522), 158 states have call successors, (158), 78 states have call predecessors, (158), 77 states have return successors, (157), 149 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 04:19:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1837 transitions. [2025-01-09 04:19:28,950 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1837 transitions. Word has length 288 [2025-01-09 04:19:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1837 transitions. [2025-01-09 04:19:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1837 transitions. [2025-01-09 04:19:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 04:19:28,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:28,952 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:28,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:29,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 04:19:29,153 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1987402808, now seen corresponding path program 1 times [2025-01-09 04:19:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246484311] [2025-01-09 04:19:29,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:29,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 04:19:29,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 04:19:29,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:29,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-01-09 04:19:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246484311] [2025-01-09 04:19:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246484311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:29,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166528302] [2025-01-09 04:19:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:29,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:29,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:29,258 INFO L87 Difference]: Start difference. First operand 1440 states and 1837 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 04:19:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:29,443 INFO L93 Difference]: Finished difference Result 2463 states and 3163 transitions. [2025-01-09 04:19:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 296 [2025-01-09 04:19:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:29,450 INFO L225 Difference]: With dead ends: 2463 [2025-01-09 04:19:29,450 INFO L226 Difference]: Without dead ends: 1376 [2025-01-09 04:19:29,452 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-01-09 04:19:29,452 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 431 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:29,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 858 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-01-09 04:19:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1139. [2025-01-09 04:19:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 967 states have (on average 1.2388831437435368) internal successors, (1198), 972 states have internal predecessors, (1198), 116 states have call successors, (116), 55 states have call predecessors, (116), 55 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 04:19:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1430 transitions. [2025-01-09 04:19:29,496 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1430 transitions. Word has length 296 [2025-01-09 04:19:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:29,496 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1430 transitions. [2025-01-09 04:19:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 04:19:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1430 transitions. [2025-01-09 04:19:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 04:19:29,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:29,500 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:29,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:19:29,500 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash 456704585, now seen corresponding path program 1 times [2025-01-09 04:19:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:29,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095667122] [2025-01-09 04:19:29,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:29,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 04:19:29,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 04:19:29,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:29,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2025-01-09 04:19:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095667122] [2025-01-09 04:19:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095667122] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854707340] [2025-01-09 04:19:30,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:30,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:30,245 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:30,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-09 04:19:30,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 04:19:30,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 04:19:30,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 04:19:30,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 195 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 04:19:31,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-01-09 04:19:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854707340] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:32,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 18] total 43 [2025-01-09 04:19:32,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728058373] [2025-01-09 04:19:32,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:32,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 04:19:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:32,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 04:19:32,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:19:32,262 INFO L87 Difference]: Start difference. First operand 1139 states and 1430 transitions. Second operand has 43 states, 42 states have (on average 7.214285714285714) internal successors, (303), 39 states have internal predecessors, (303), 17 states have call successors, (56), 8 states have call predecessors, (56), 10 states have return successors, (55), 19 states have call predecessors, (55), 16 states have call successors, (55) [2025-01-09 04:19:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,925 INFO L93 Difference]: Finished difference Result 15394 states and 20828 transitions. [2025-01-09 04:19:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 447 states. [2025-01-09 04:19:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 7.214285714285714) internal successors, (303), 39 states have internal predecessors, (303), 17 states have call successors, (56), 8 states have call predecessors, (56), 10 states have return successors, (55), 19 states have call predecessors, (55), 16 states have call successors, (55) Word has length 336 [2025-01-09 04:19:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,965 INFO L225 Difference]: With dead ends: 15394 [2025-01-09 04:19:52,965 INFO L226 Difference]: Without dead ends: 14616 [2025-01-09 04:19:52,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1191 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100528 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=12133, Invalid=222607, Unknown=0, NotChecked=0, Total=234740 [2025-01-09 04:19:52,990 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 11642 mSDsluCounter, 26540 mSDsCounter, 0 mSdLazyCounter, 14108 mSolverCounterSat, 3023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11650 SdHoareTripleChecker+Valid, 27587 SdHoareTripleChecker+Invalid, 17131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3023 IncrementalHoareTripleChecker+Valid, 14108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11650 Valid, 27587 Invalid, 17131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3023 Valid, 14108 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-01-09 04:19:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14616 states. [2025-01-09 04:19:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14616 to 3458. [2025-01-09 04:19:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2890 states have (on average 1.2515570934256055) internal successors, (3617), 2916 states have internal predecessors, (3617), 382 states have call successors, (382), 185 states have call predecessors, (382), 185 states have return successors, (382), 356 states have call predecessors, (382), 382 states have call successors, (382) [2025-01-09 04:19:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4381 transitions. [2025-01-09 04:19:53,265 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4381 transitions. Word has length 336 [2025-01-09 04:19:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:53,265 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4381 transitions. [2025-01-09 04:19:53,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 7.214285714285714) internal successors, (303), 39 states have internal predecessors, (303), 17 states have call successors, (56), 8 states have call predecessors, (56), 10 states have return successors, (55), 19 states have call predecessors, (55), 16 states have call successors, (55) [2025-01-09 04:19:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4381 transitions. [2025-01-09 04:19:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 04:19:53,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:53,272 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:53,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 04:19:53,474 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:53,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 45166831, now seen corresponding path program 1 times [2025-01-09 04:19:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461628199] [2025-01-09 04:19:53,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:53,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 04:19:53,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 04:19:53,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:53,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-01-09 04:19:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461628199] [2025-01-09 04:19:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461628199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:19:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702507003] [2025-01-09 04:19:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:54,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:54,518 INFO L87 Difference]: Start difference. First operand 3458 states and 4381 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:19:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,969 INFO L93 Difference]: Finished difference Result 7340 states and 9306 transitions. [2025-01-09 04:19:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 337 [2025-01-09 04:19:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,980 INFO L225 Difference]: With dead ends: 7340 [2025-01-09 04:19:54,980 INFO L226 Difference]: Without dead ends: 4442 [2025-01-09 04:19:54,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:54,984 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 77 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1684 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2025-01-09 04:19:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4015. [2025-01-09 04:19:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 3307 states have (on average 1.2473540973692168) internal successors, (4125), 3345 states have internal predecessors, (4125), 451 states have call successors, (451), 227 states have call predecessors, (451), 256 states have return successors, (489), 442 states have call predecessors, (489), 451 states have call successors, (489) [2025-01-09 04:19:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5065 transitions. [2025-01-09 04:19:55,254 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5065 transitions. Word has length 337 [2025-01-09 04:19:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:55,255 INFO L471 AbstractCegarLoop]: Abstraction has 4015 states and 5065 transitions. [2025-01-09 04:19:55,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:19:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5065 transitions. [2025-01-09 04:19:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 04:19:55,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:55,263 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:55,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:19:55,263 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash -151346674, now seen corresponding path program 1 times [2025-01-09 04:19:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692642772] [2025-01-09 04:19:55,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:55,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 04:19:55,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 04:19:55,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:55,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2025-01-09 04:19:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:55,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692642772] [2025-01-09 04:19:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692642772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620564704] [2025-01-09 04:19:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:55,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:55,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:55,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:55,382 INFO L87 Difference]: Start difference. First operand 4015 states and 5065 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 04:19:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:55,660 INFO L93 Difference]: Finished difference Result 8099 states and 10198 transitions. [2025-01-09 04:19:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 337 [2025-01-09 04:19:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:55,669 INFO L225 Difference]: With dead ends: 8099 [2025-01-09 04:19:55,669 INFO L226 Difference]: Without dead ends: 3899 [2025-01-09 04:19:55,674 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-01-09 04:19:55,675 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 26 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:55,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 646 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2025-01-09 04:19:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3899. [2025-01-09 04:19:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3899 states, 3220 states have (on average 1.2142857142857142) internal successors, (3910), 3258 states have internal predecessors, (3910), 451 states have call successors, (451), 227 states have call predecessors, (451), 227 states have return successors, (451), 413 states have call predecessors, (451), 451 states have call successors, (451) [2025-01-09 04:19:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4812 transitions. [2025-01-09 04:19:56,012 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 4812 transitions. Word has length 337 [2025-01-09 04:19:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 3899 states and 4812 transitions. [2025-01-09 04:19:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 04:19:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 4812 transitions. [2025-01-09 04:19:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-09 04:19:56,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:56,023 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:19:56,023 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1675581996, now seen corresponding path program 1 times [2025-01-09 04:19:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370114803] [2025-01-09 04:19:56,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:56,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-09 04:19:56,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-09 04:19:56,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:56,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-01-09 04:19:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370114803] [2025-01-09 04:19:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370114803] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640113786] [2025-01-09 04:19:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:57,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:57,257 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:57,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-01-09 04:19:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-09 04:19:57,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-09 04:19:57,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:57,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:57,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 04:19:57,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 248 proven. 100 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 04:19:58,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2025-01-09 04:19:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640113786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:59,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 46 [2025-01-09 04:19:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563630686] [2025-01-09 04:19:59,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:59,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 04:19:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:59,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 04:19:59,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:19:59,029 INFO L87 Difference]: Start difference. First operand 3899 states and 4812 transitions. Second operand has 46 states, 45 states have (on average 7.311111111111111) internal successors, (329), 42 states have internal predecessors, (329), 18 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 20 states have call predecessors, (61), 17 states have call successors, (61) [2025-01-09 04:20:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:25,315 INFO L93 Difference]: Finished difference Result 48200 states and 63457 transitions. [2025-01-09 04:20:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 453 states. [2025-01-09 04:20:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 7.311111111111111) internal successors, (329), 42 states have internal predecessors, (329), 18 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 20 states have call predecessors, (61), 17 states have call successors, (61) Word has length 347 [2025-01-09 04:20:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:25,451 INFO L225 Difference]: With dead ends: 48200 [2025-01-09 04:20:25,451 INFO L226 Difference]: Without dead ends: 44915 [2025-01-09 04:20:25,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104926 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=13587, Invalid=232925, Unknown=0, NotChecked=0, Total=246512 [2025-01-09 04:20:25,487 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 8415 mSDsluCounter, 28937 mSDsCounter, 0 mSdLazyCounter, 18172 mSolverCounterSat, 2222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8415 SdHoareTripleChecker+Valid, 30079 SdHoareTripleChecker+Invalid, 20394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2222 IncrementalHoareTripleChecker+Valid, 18172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:25,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8415 Valid, 30079 Invalid, 20394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2222 Valid, 18172 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-01-09 04:20:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44915 states. [2025-01-09 04:20:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44915 to 10422. [2025-01-09 04:20:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10422 states, 8560 states have (on average 1.2210280373831777) internal successors, (10452), 8669 states have internal predecessors, (10452), 1229 states have call successors, (1229), 632 states have call predecessors, (1229), 632 states have return successors, (1229), 1120 states have call predecessors, (1229), 1229 states have call successors, (1229) [2025-01-09 04:20:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10422 states to 10422 states and 12910 transitions. [2025-01-09 04:20:26,942 INFO L78 Accepts]: Start accepts. Automaton has 10422 states and 12910 transitions. Word has length 347 [2025-01-09 04:20:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 10422 states and 12910 transitions. [2025-01-09 04:20:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 7.311111111111111) internal successors, (329), 42 states have internal predecessors, (329), 18 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 20 states have call predecessors, (61), 17 states have call successors, (61) [2025-01-09 04:20:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10422 states and 12910 transitions. [2025-01-09 04:20:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 04:20:26,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:26,969 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:26,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-01-09 04:20:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-01-09 04:20:27,170 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1814131591, now seen corresponding path program 1 times [2025-01-09 04:20:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226813825] [2025-01-09 04:20:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:27,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 04:20:27,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 04:20:27,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:27,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-01-09 04:20:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226813825] [2025-01-09 04:20:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226813825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211626655] [2025-01-09 04:20:28,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:28,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:28,349 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:20:28,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-01-09 04:20:28,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 04:20:28,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 04:20:28,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:28,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:28,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 04:20:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 258 proven. 89 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-01-09 04:20:28,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-01-09 04:20:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211626655] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:29,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2025-01-09 04:20:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711056449] [2025-01-09 04:20:29,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:29,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:20:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:29,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:20:29,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:20:29,357 INFO L87 Difference]: Start difference. First operand 10422 states and 12910 transitions. Second operand has 33 states, 33 states have (on average 7.909090909090909) internal successors, (261), 27 states have internal predecessors, (261), 7 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (49), 12 states have call predecessors, (49), 6 states have call successors, (49)