./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:46:01,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:46:01,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:46:01,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:46:01,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:46:01,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:46:01,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:46:01,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:46:01,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:46:01,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:46:01,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:46:01,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:46:01,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:46:01,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:46:01,487 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:46:01,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:46:01,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:46:01,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:46:01,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:46:01,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:46:01,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:46:01,490 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 -> b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 [2025-02-06 03:46:01,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:46:01,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:46:01,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:46:01,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:46:01,695 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:46:01,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2025-02-06 03:46:02,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbd179e82/264c48a6a2d74ac1afced96384c24aae/FLAG8e07eecfa [2025-02-06 03:46:03,132 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:46:03,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2025-02-06 03:46:03,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbd179e82/264c48a6a2d74ac1afced96384c24aae/FLAG8e07eecfa [2025-02-06 03:46:03,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbd179e82/264c48a6a2d74ac1afced96384c24aae [2025-02-06 03:46:03,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:46:03,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:46:03,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:03,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:46:03,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:46:03,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cabecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03, skipping insertion in model container [2025-02-06 03:46:03,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:46:03,287 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i[916,929] [2025-02-06 03:46:03,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:03,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:46:03,334 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i[916,929] [2025-02-06 03:46:03,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:46:03,370 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:46:03,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03 WrapperNode [2025-02-06 03:46:03,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:46:03,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:03,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:46:03,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:46:03,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,411 INFO L138 Inliner]: procedures = 26, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2025-02-06 03:46:03,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:46:03,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:46:03,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:46:03,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:46:03,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,444 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 7, 13, 12, 6, 12, 9, 8, 12, 7, 5, 10, 4]. 12 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2025-02-06 03:46:03,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:46:03,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:46:03,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:46:03,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:46:03,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (1/1) ... [2025-02-06 03:46:03,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:46:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:03,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:46:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:46:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:46:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:46:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:46:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:46:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:46:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:46:03,627 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:46:03,628 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:46:03,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem64#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~short63#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite100#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite99#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite98#1;havoc property_#t~mem88#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1; [2025-02-06 03:46:03,960 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-02-06 03:46:03,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:46:03,975 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:46:03,975 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:46:03,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:03 BoogieIcfgContainer [2025-02-06 03:46:03,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:46:03,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:46:03,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:46:03,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:46:03,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:46:03" (1/3) ... [2025-02-06 03:46:03,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524044ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:03, skipping insertion in model container [2025-02-06 03:46:03,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:46:03" (2/3) ... [2025-02-06 03:46:03,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524044ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:46:03, skipping insertion in model container [2025-02-06 03:46:03,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:46:03" (3/3) ... [2025-02-06 03:46:03,983 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-89.i [2025-02-06 03:46:03,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:46:03,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-89.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:46:04,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:46:04,038 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;@528db6a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:46:04,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:46:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:46:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:04,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:04,050 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:04,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:04,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1246125892, now seen corresponding path program 1 times [2025-02-06 03:46:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:04,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15997683] [2025-02-06 03:46:04,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:04,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:04,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:04,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:46:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15997683] [2025-02-06 03:46:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15997683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310603760] [2025-02-06 03:46:04,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:04,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:04,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:46:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:04,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:04,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:04,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:04,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:46:04,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:46:04,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310603760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:04,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:46:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905897982] [2025-02-06 03:46:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:04,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:46:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:04,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:46:04,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:46:04,548 INFO L87 Difference]: Start difference. First operand has 101 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 03:46:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:04,574 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-02-06 03:46:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:46:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-02-06 03:46:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:04,580 INFO L225 Difference]: With dead ends: 196 [2025-02-06 03:46:04,581 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:46:04,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:46:04,586 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:04,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:46:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:46:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:46:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2025-02-06 03:46:04,617 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2025-02-06 03:46:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2025-02-06 03:46:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 03:46:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2025-02-06 03:46:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:04,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:04,620 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:04,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:46:04,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1170187697, now seen corresponding path program 1 times [2025-02-06 03:46:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082111310] [2025-02-06 03:46:04,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:04,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:04,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:04,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:04,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082111310] [2025-02-06 03:46:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082111310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572843363] [2025-02-06 03:46:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:05,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:05,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:05,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:05,108 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:05,152 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-02-06 03:46:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:05,157 INFO L225 Difference]: With dead ends: 196 [2025-02-06 03:46:05,158 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:46:05,159 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-02-06 03:46:05,159 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:05,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:46:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-02-06 03:46:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:46:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-02-06 03:46:05,175 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2025-02-06 03:46:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:05,176 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-02-06 03:46:05,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-02-06 03:46:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:05,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:05,180 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:46:05,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1317325136, now seen corresponding path program 1 times [2025-02-06 03:46:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848568306] [2025-02-06 03:46:05,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:05,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:05,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:05,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:05,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:05,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848568306] [2025-02-06 03:46:05,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848568306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:05,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:05,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909173889] [2025-02-06 03:46:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:05,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:05,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:05,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:05,335 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:05,370 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-02-06 03:46:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:05,372 INFO L225 Difference]: With dead ends: 200 [2025-02-06 03:46:05,372 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 03:46:05,373 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-02-06 03:46:05,373 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:05,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 03:46:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-02-06 03:46:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:46:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2025-02-06 03:46:05,399 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 109 [2025-02-06 03:46:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2025-02-06 03:46:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2025-02-06 03:46:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:05,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:05,405 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:46:05,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2090138479, now seen corresponding path program 1 times [2025-02-06 03:46:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608057836] [2025-02-06 03:46:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:05,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:05,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:05,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:05,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608057836] [2025-02-06 03:46:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608057836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:05,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20309374] [2025-02-06 03:46:05,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:05,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:05,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:05,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:05,537 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:05,576 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2025-02-06 03:46:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:05,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:05,578 INFO L225 Difference]: With dead ends: 204 [2025-02-06 03:46:05,581 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 03:46:05,582 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-02-06 03:46:05,582 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:05,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 03:46:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 03:46:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:46:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2025-02-06 03:46:05,591 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 109 [2025-02-06 03:46:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:05,591 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2025-02-06 03:46:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2025-02-06 03:46:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:05,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:05,595 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:05,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:46:05,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:05,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2089214958, now seen corresponding path program 1 times [2025-02-06 03:46:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244868734] [2025-02-06 03:46:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:05,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:05,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:05,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:05,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244868734] [2025-02-06 03:46:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244868734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:06,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144619595] [2025-02-06 03:46:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:06,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:06,032 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:06,116 INFO L93 Difference]: Finished difference Result 278 states and 392 transitions. [2025-02-06 03:46:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:06,119 INFO L225 Difference]: With dead ends: 278 [2025-02-06 03:46:06,119 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 03:46:06,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:06,120 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 91 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:06,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 497 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 03:46:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-02-06 03:46:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:46:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2025-02-06 03:46:06,136 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 244 transitions. Word has length 109 [2025-02-06 03:46:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:06,137 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 244 transitions. [2025-02-06 03:46:06,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 244 transitions. [2025-02-06 03:46:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:06,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:06,139 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:06,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:46:06,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1695218161, now seen corresponding path program 1 times [2025-02-06 03:46:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228842021] [2025-02-06 03:46:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:06,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:06,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:06,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:06,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228842021] [2025-02-06 03:46:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228842021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:06,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866822871] [2025-02-06 03:46:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:06,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:06,708 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:06,831 INFO L93 Difference]: Finished difference Result 383 states and 539 transitions. [2025-02-06 03:46:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:46:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:06,833 INFO L225 Difference]: With dead ends: 383 [2025-02-06 03:46:06,833 INFO L226 Difference]: Without dead ends: 213 [2025-02-06 03:46:06,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:46:06,834 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 136 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:06,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 756 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-06 03:46:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2025-02-06 03:46:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 170 states have internal predecessors, (227), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:46:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2025-02-06 03:46:06,843 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 109 [2025-02-06 03:46:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2025-02-06 03:46:06,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2025-02-06 03:46:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:06,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:06,848 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:06,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:46:06,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:06,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1277840234, now seen corresponding path program 1 times [2025-02-06 03:46:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:06,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304879639] [2025-02-06 03:46:06,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:06,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304879639] [2025-02-06 03:46:07,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304879639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:07,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:07,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:07,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6932734] [2025-02-06 03:46:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:07,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:07,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:07,147 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:07,237 INFO L93 Difference]: Finished difference Result 398 states and 557 transitions. [2025-02-06 03:46:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:07,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:07,241 INFO L225 Difference]: With dead ends: 398 [2025-02-06 03:46:07,241 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 03:46:07,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:07,243 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 173 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:07,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 373 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 03:46:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-02-06 03:46:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 170 states have internal predecessors, (226), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:46:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2025-02-06 03:46:07,258 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 109 [2025-02-06 03:46:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2025-02-06 03:46:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2025-02-06 03:46:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:07,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:07,259 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:07,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:46:07,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1788374411, now seen corresponding path program 1 times [2025-02-06 03:46:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363352533] [2025-02-06 03:46:07,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:07,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:07,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:07,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363352533] [2025-02-06 03:46:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363352533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188368465] [2025-02-06 03:46:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:07,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:07,766 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:07,902 INFO L93 Difference]: Finished difference Result 409 states and 571 transitions. [2025-02-06 03:46:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:46:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:07,904 INFO L225 Difference]: With dead ends: 409 [2025-02-06 03:46:07,905 INFO L226 Difference]: Without dead ends: 213 [2025-02-06 03:46:07,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:46:07,905 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 132 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:07,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 956 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-06 03:46:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-02-06 03:46:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 168 states have internal predecessors, (223), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:46:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 275 transitions. [2025-02-06 03:46:07,922 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 275 transitions. Word has length 109 [2025-02-06 03:46:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:07,922 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 275 transitions. [2025-02-06 03:46:07,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 275 transitions. [2025-02-06 03:46:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:07,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:07,923 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:07,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:46:07,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:07,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -51158669, now seen corresponding path program 1 times [2025-02-06 03:46:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:07,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747202881] [2025-02-06 03:46:07,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:07,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:08,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:08,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:08,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747202881] [2025-02-06 03:46:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747202881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166183006] [2025-02-06 03:46:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:08,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:08,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:08,649 INFO L87 Difference]: Start difference. First operand 197 states and 275 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:08,909 INFO L93 Difference]: Finished difference Result 469 states and 656 transitions. [2025-02-06 03:46:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:46:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:08,911 INFO L225 Difference]: With dead ends: 469 [2025-02-06 03:46:08,912 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 03:46:08,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:08,912 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 100 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:08,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1165 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 03:46:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2025-02-06 03:46:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 236 states have (on average 1.3516949152542372) internal successors, (319), 238 states have internal predecessors, (319), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:46:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 381 transitions. [2025-02-06 03:46:08,930 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 381 transitions. Word has length 109 [2025-02-06 03:46:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:08,931 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 381 transitions. [2025-02-06 03:46:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 381 transitions. [2025-02-06 03:46:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:08,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:08,932 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:08,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:46:08,932 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -561692846, now seen corresponding path program 1 times [2025-02-06 03:46:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641811027] [2025-02-06 03:46:08,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:08,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:08,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:09,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641811027] [2025-02-06 03:46:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641811027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190119439] [2025-02-06 03:46:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:09,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:09,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:09,129 INFO L87 Difference]: Start difference. First operand 272 states and 381 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:09,208 INFO L93 Difference]: Finished difference Result 546 states and 762 transitions. [2025-02-06 03:46:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:09,212 INFO L225 Difference]: With dead ends: 546 [2025-02-06 03:46:09,212 INFO L226 Difference]: Without dead ends: 277 [2025-02-06 03:46:09,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:09,213 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 171 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:09,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 467 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-06 03:46:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2025-02-06 03:46:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 238 states have (on average 1.3445378151260505) internal successors, (320), 240 states have internal predecessors, (320), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:46:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 382 transitions. [2025-02-06 03:46:09,223 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 382 transitions. Word has length 109 [2025-02-06 03:46:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:09,223 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 382 transitions. [2025-02-06 03:46:09,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 382 transitions. [2025-02-06 03:46:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:09,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:09,224 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:46:09,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:09,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 760216055, now seen corresponding path program 1 times [2025-02-06 03:46:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286553452] [2025-02-06 03:46:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:09,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:09,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:09,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:09,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286553452] [2025-02-06 03:46:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286553452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286752448] [2025-02-06 03:46:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:09,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:09,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:09,734 INFO L87 Difference]: Start difference. First operand 275 states and 382 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:09,974 INFO L93 Difference]: Finished difference Result 817 states and 1135 transitions. [2025-02-06 03:46:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:09,978 INFO L225 Difference]: With dead ends: 817 [2025-02-06 03:46:09,978 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 03:46:09,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:09,979 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 214 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:09,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 719 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 03:46:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2025-02-06 03:46:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 464 states have (on average 1.3426724137931034) internal successors, (623), 468 states have internal predecessors, (623), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:46:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 747 transitions. [2025-02-06 03:46:10,014 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 747 transitions. Word has length 109 [2025-02-06 03:46:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:10,014 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 747 transitions. [2025-02-06 03:46:10,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 747 transitions. [2025-02-06 03:46:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:10,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:10,016 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:46:10,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1916045047, now seen corresponding path program 1 times [2025-02-06 03:46:10,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:10,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543302423] [2025-02-06 03:46:10,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:10,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:10,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:10,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543302423] [2025-02-06 03:46:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543302423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036210454] [2025-02-06 03:46:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:10,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:10,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:10,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:10,644 INFO L87 Difference]: Start difference. First operand 537 states and 747 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:10,938 INFO L93 Difference]: Finished difference Result 1075 states and 1493 transitions. [2025-02-06 03:46:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:10,941 INFO L225 Difference]: With dead ends: 1075 [2025-02-06 03:46:10,941 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 03:46:10,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:10,942 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:10,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 719 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 03:46:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-02-06 03:46:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 462 states have (on average 1.3398268398268398) internal successors, (619), 466 states have internal predecessors, (619), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:46:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 743 transitions. [2025-02-06 03:46:10,965 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 743 transitions. Word has length 109 [2025-02-06 03:46:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:10,965 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 743 transitions. [2025-02-06 03:46:10,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 743 transitions. [2025-02-06 03:46:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:10,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:10,967 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:46:10,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1567547525, now seen corresponding path program 1 times [2025-02-06 03:46:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271650552] [2025-02-06 03:46:10,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:10,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:10,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:10,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:10,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271650552] [2025-02-06 03:46:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271650552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071910930] [2025-02-06 03:46:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:11,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:11,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:11,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:11,516 INFO L87 Difference]: Start difference. First operand 535 states and 743 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:11,769 INFO L93 Difference]: Finished difference Result 1253 states and 1739 transitions. [2025-02-06 03:46:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:46:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:11,773 INFO L225 Difference]: With dead ends: 1253 [2025-02-06 03:46:11,773 INFO L226 Difference]: Without dead ends: 721 [2025-02-06 03:46:11,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:46:11,774 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 108 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:11,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 979 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-06 03:46:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 716. [2025-02-06 03:46:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 618 states have (on average 1.338187702265372) internal successors, (827), 625 states have internal predecessors, (827), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 03:46:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 993 transitions. [2025-02-06 03:46:11,802 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 993 transitions. Word has length 109 [2025-02-06 03:46:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:11,802 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 993 transitions. [2025-02-06 03:46:11,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 993 transitions. [2025-02-06 03:46:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:11,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:11,804 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:11,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:46:11,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:11,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2078081702, now seen corresponding path program 1 times [2025-02-06 03:46:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21630471] [2025-02-06 03:46:11,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:11,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:11,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:11,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21630471] [2025-02-06 03:46:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21630471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027611213] [2025-02-06 03:46:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:11,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:11,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:11,928 INFO L87 Difference]: Start difference. First operand 716 states and 993 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:12,013 INFO L93 Difference]: Finished difference Result 1412 states and 1957 transitions. [2025-02-06 03:46:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:12,017 INFO L225 Difference]: With dead ends: 1412 [2025-02-06 03:46:12,017 INFO L226 Difference]: Without dead ends: 722 [2025-02-06 03:46:12,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:12,019 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 171 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:12,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 547 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-06 03:46:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2025-02-06 03:46:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 620 states have (on average 1.332258064516129) internal successors, (826), 627 states have internal predecessors, (826), 83 states have call successors, (83), 16 states have call predecessors, (83), 16 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 03:46:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 992 transitions. [2025-02-06 03:46:12,048 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 992 transitions. Word has length 109 [2025-02-06 03:46:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:12,049 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 992 transitions. [2025-02-06 03:46:12,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 992 transitions. [2025-02-06 03:46:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:12,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:12,050 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:12,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:46:12,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash 689363482, now seen corresponding path program 1 times [2025-02-06 03:46:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532860366] [2025-02-06 03:46:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:12,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:12,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532860366] [2025-02-06 03:46:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532860366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098038043] [2025-02-06 03:46:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:12,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:12,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:12,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:12,179 INFO L87 Difference]: Start difference. First operand 720 states and 992 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:12,259 INFO L93 Difference]: Finished difference Result 1425 states and 1961 transitions. [2025-02-06 03:46:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:12,262 INFO L225 Difference]: With dead ends: 1425 [2025-02-06 03:46:12,263 INFO L226 Difference]: Without dead ends: 731 [2025-02-06 03:46:12,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:12,264 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 175 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 440 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:12,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 440 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-02-06 03:46:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 561. [2025-02-06 03:46:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 498 states have (on average 1.3493975903614457) internal successors, (672), 502 states have internal predecessors, (672), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:46:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 772 transitions. [2025-02-06 03:46:12,288 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 772 transitions. Word has length 109 [2025-02-06 03:46:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 772 transitions. [2025-02-06 03:46:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 772 transitions. [2025-02-06 03:46:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:46:12,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:12,290 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:46:12,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:12,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 178829305, now seen corresponding path program 1 times [2025-02-06 03:46:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857801453] [2025-02-06 03:46:12,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:12,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:46:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:46:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857801453] [2025-02-06 03:46:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857801453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:46:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220436739] [2025-02-06 03:46:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:46:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:12,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:46:12,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:12,545 INFO L87 Difference]: Start difference. First operand 561 states and 772 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:12,685 INFO L93 Difference]: Finished difference Result 1314 states and 1802 transitions. [2025-02-06 03:46:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:46:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-02-06 03:46:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:12,689 INFO L225 Difference]: With dead ends: 1314 [2025-02-06 03:46:12,689 INFO L226 Difference]: Without dead ends: 756 [2025-02-06 03:46:12,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:46:12,690 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 136 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:12,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1111 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-02-06 03:46:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 557. [2025-02-06 03:46:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 494 states have (on average 1.3502024291497976) internal successors, (667), 498 states have internal predecessors, (667), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:46:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 767 transitions. [2025-02-06 03:46:12,721 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 767 transitions. Word has length 109 [2025-02-06 03:46:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:12,721 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 767 transitions. [2025-02-06 03:46:12,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 767 transitions. [2025-02-06 03:46:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:46:12,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:12,722 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:46:12,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 128561909, now seen corresponding path program 1 times [2025-02-06 03:46:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234325615] [2025-02-06 03:46:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:12,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:46:12,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:46:12,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:12,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234325615] [2025-02-06 03:46:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234325615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:12,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:12,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769148080] [2025-02-06 03:46:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:12,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:12,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:12,846 INFO L87 Difference]: Start difference. First operand 557 states and 767 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:12,976 INFO L93 Difference]: Finished difference Result 1341 states and 1848 transitions. [2025-02-06 03:46:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2025-02-06 03:46:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:12,980 INFO L225 Difference]: With dead ends: 1341 [2025-02-06 03:46:12,980 INFO L226 Difference]: Without dead ends: 787 [2025-02-06 03:46:12,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:12,981 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 110 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:12,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 495 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-02-06 03:46:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 680. [2025-02-06 03:46:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 601 states have (on average 1.346089850249584) internal successors, (809), 605 states have internal predecessors, (809), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 935 transitions. [2025-02-06 03:46:13,011 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 935 transitions. Word has length 111 [2025-02-06 03:46:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 935 transitions. [2025-02-06 03:46:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 935 transitions. [2025-02-06 03:46:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:46:13,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:13,014 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:46:13,014 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1301648309, now seen corresponding path program 1 times [2025-02-06 03:46:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898616094] [2025-02-06 03:46:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:13,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:46:13,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:46:13,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:13,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:46:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898616094] [2025-02-06 03:46:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898616094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321811040] [2025-02-06 03:46:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:13,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:13,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:46:13,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:46:13,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:46:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:13,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:13,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:13,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321811040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:46:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570110226] [2025-02-06 03:46:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:13,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:13,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:13,321 INFO L87 Difference]: Start difference. First operand 680 states and 935 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:13,379 INFO L93 Difference]: Finished difference Result 1252 states and 1723 transitions. [2025-02-06 03:46:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2025-02-06 03:46:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:13,384 INFO L225 Difference]: With dead ends: 1252 [2025-02-06 03:46:13,384 INFO L226 Difference]: Without dead ends: 698 [2025-02-06 03:46:13,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:13,385 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-06 03:46:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-02-06 03:46:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 619 states have (on average 1.3360258481421647) internal successors, (827), 623 states have internal predecessors, (827), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 953 transitions. [2025-02-06 03:46:13,419 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 953 transitions. Word has length 111 [2025-02-06 03:46:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 953 transitions. [2025-02-06 03:46:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 953 transitions. [2025-02-06 03:46:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:46:13,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:13,420 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:13,443 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-02-06 03:46:13,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:46:13,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1766749103, now seen corresponding path program 1 times [2025-02-06 03:46:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574150241] [2025-02-06 03:46:13,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:13,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:46:13,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:46:13,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:13,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:13,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574150241] [2025-02-06 03:46:13,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574150241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:13,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:13,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071286707] [2025-02-06 03:46:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:13,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:46:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:13,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:46:13,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:13,954 INFO L87 Difference]: Start difference. First operand 698 states and 953 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,057 INFO L93 Difference]: Finished difference Result 718 states and 978 transitions. [2025-02-06 03:46:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:14,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-02-06 03:46:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,061 INFO L225 Difference]: With dead ends: 718 [2025-02-06 03:46:14,061 INFO L226 Difference]: Without dead ends: 716 [2025-02-06 03:46:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:14,062 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 688 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-06 03:46:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-02-06 03:46:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3265306122448979) internal successors, (845), 641 states have internal predecessors, (845), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 971 transitions. [2025-02-06 03:46:14,088 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 971 transitions. Word has length 113 [2025-02-06 03:46:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,088 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 971 transitions. [2025-02-06 03:46:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 971 transitions. [2025-02-06 03:46:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:46:14,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,090 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:14,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:46:14,090 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1767672624, now seen corresponding path program 1 times [2025-02-06 03:46:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103532576] [2025-02-06 03:46:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:46:14,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:46:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103532576] [2025-02-06 03:46:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103532576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:14,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:14,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:46:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051564323] [2025-02-06 03:46:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:14,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:46:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:14,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:46:14,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:46:14,367 INFO L87 Difference]: Start difference. First operand 716 states and 971 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,546 INFO L93 Difference]: Finished difference Result 1310 states and 1775 transitions. [2025-02-06 03:46:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:14,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-02-06 03:46:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,549 INFO L225 Difference]: With dead ends: 1310 [2025-02-06 03:46:14,550 INFO L226 Difference]: Without dead ends: 720 [2025-02-06 03:46:14,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:14,553 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 202 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 772 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-02-06 03:46:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 716. [2025-02-06 03:46:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3218210361067504) internal successors, (842), 641 states have internal predecessors, (842), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-02-06 03:46:14,577 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 113 [2025-02-06 03:46:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,578 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-02-06 03:46:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-02-06 03:46:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:46:14,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,579 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:46:14,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1639790991, now seen corresponding path program 1 times [2025-02-06 03:46:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304978719] [2025-02-06 03:46:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:46:14,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:46:14,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304978719] [2025-02-06 03:46:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304978719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:14,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459454550] [2025-02-06 03:46:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:14,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:14,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:14,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:14,685 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:14,748 INFO L93 Difference]: Finished difference Result 1314 states and 1771 transitions. [2025-02-06 03:46:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-02-06 03:46:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:14,752 INFO L225 Difference]: With dead ends: 1314 [2025-02-06 03:46:14,752 INFO L226 Difference]: Without dead ends: 724 [2025-02-06 03:46:14,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 03:46:14,754 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 102 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 557 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-06 03:46:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-02-06 03:46:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 643 states have (on average 1.3094867807153965) internal successors, (842), 647 states have internal predecessors, (842), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 968 transitions. [2025-02-06 03:46:14,793 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 968 transitions. Word has length 113 [2025-02-06 03:46:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 968 transitions. [2025-02-06 03:46:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 968 transitions. [2025-02-06 03:46:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:46:14,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:14,795 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:46:14,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash 847721842, now seen corresponding path program 1 times [2025-02-06 03:46:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648975587] [2025-02-06 03:46:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:46:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:46:14,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:46:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648975587] [2025-02-06 03:46:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648975587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802064335] [2025-02-06 03:46:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:14,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:14,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:14,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:14,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:46:14,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:46:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:46:15,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:15,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:15,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:46:15,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:15,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802064335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:15,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:46:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270758773] [2025-02-06 03:46:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:15,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:15,057 INFO L87 Difference]: Start difference. First operand 724 states and 968 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:15,102 INFO L93 Difference]: Finished difference Result 1340 states and 1789 transitions. [2025-02-06 03:46:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-02-06 03:46:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:15,105 INFO L225 Difference]: With dead ends: 1340 [2025-02-06 03:46:15,105 INFO L226 Difference]: Without dead ends: 742 [2025-02-06 03:46:15,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:15,109 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:15,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-06 03:46:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-02-06 03:46:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 661 states have (on average 1.3010590015128594) internal successors, (860), 665 states have internal predecessors, (860), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 986 transitions. [2025-02-06 03:46:15,135 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 986 transitions. Word has length 113 [2025-02-06 03:46:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 986 transitions. [2025-02-06 03:46:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 986 transitions. [2025-02-06 03:46:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:46:15,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:15,137 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:15,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:46:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:15,338 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2015500886, now seen corresponding path program 1 times [2025-02-06 03:46:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376174368] [2025-02-06 03:46:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:15,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:46:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:46:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:46:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:15,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376174368] [2025-02-06 03:46:15,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376174368] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:15,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724153272] [2025-02-06 03:46:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:15,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:15,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:15,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:15,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:46:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:46:15,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:46:15,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:15,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:15,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:46:15,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:15,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:46:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724153272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:46:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:46:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407871550] [2025-02-06 03:46:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:15,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:15,603 INFO L87 Difference]: Start difference. First operand 742 states and 986 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:15,643 INFO L93 Difference]: Finished difference Result 1382 states and 1831 transitions. [2025-02-06 03:46:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2025-02-06 03:46:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:15,646 INFO L225 Difference]: With dead ends: 1382 [2025-02-06 03:46:15,646 INFO L226 Difference]: Without dead ends: 766 [2025-02-06 03:46:15,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:46:15,648 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:15,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-06 03:46:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 748. [2025-02-06 03:46:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 667 states have (on average 1.2983508245877062) internal successors, (866), 671 states have internal predecessors, (866), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 992 transitions. [2025-02-06 03:46:15,670 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 992 transitions. Word has length 116 [2025-02-06 03:46:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:15,670 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 992 transitions. [2025-02-06 03:46:15,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 992 transitions. [2025-02-06 03:46:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:46:15,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:15,672 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:46:15,873 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,SelfDestructingSolverStorable22 [2025-02-06 03:46:15,874 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 696106501, now seen corresponding path program 1 times [2025-02-06 03:46:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947512859] [2025-02-06 03:46:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:15,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:46:15,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:46:15,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:15,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947512859] [2025-02-06 03:46:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947512859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:46:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031717202] [2025-02-06 03:46:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:15,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:46:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:15,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:46:15,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:46:15,911 INFO L87 Difference]: Start difference. First operand 748 states and 992 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:15,937 INFO L93 Difference]: Finished difference Result 1376 states and 1825 transitions. [2025-02-06 03:46:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:46:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-02-06 03:46:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:15,940 INFO L225 Difference]: With dead ends: 1376 [2025-02-06 03:46:15,940 INFO L226 Difference]: Without dead ends: 754 [2025-02-06 03:46:15,941 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-02-06 03:46:15,942 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:15,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-06 03:46:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-02-06 03:46:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2956909361069837) internal successors, (872), 677 states have internal predecessors, (872), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 998 transitions. [2025-02-06 03:46:15,976 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 998 transitions. Word has length 118 [2025-02-06 03:46:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:15,976 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 998 transitions. [2025-02-06 03:46:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 998 transitions. [2025-02-06 03:46:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:46:15,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:15,977 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:46:15,978 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1206640678, now seen corresponding path program 1 times [2025-02-06 03:46:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509689082] [2025-02-06 03:46:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:15,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:46:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:46:15,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:15,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:16,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:16,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509689082] [2025-02-06 03:46:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509689082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:16,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:16,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664178779] [2025-02-06 03:46:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:16,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:16,107 INFO L87 Difference]: Start difference. First operand 754 states and 998 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:16,197 INFO L93 Difference]: Finished difference Result 1386 states and 1829 transitions. [2025-02-06 03:46:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-02-06 03:46:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:16,200 INFO L225 Difference]: With dead ends: 1386 [2025-02-06 03:46:16,200 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 03:46:16,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:16,202 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 87 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:16,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 03:46:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-02-06 03:46:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2912332838038634) internal successors, (869), 677 states have internal predecessors, (869), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 995 transitions. [2025-02-06 03:46:16,225 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 995 transitions. Word has length 118 [2025-02-06 03:46:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:16,225 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 995 transitions. [2025-02-06 03:46:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 995 transitions. [2025-02-06 03:46:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:46:16,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:16,227 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:46:16,227 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1404579630, now seen corresponding path program 1 times [2025-02-06 03:46:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293343163] [2025-02-06 03:46:16,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:16,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:46:16,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:46:16,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:16,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293343163] [2025-02-06 03:46:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293343163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314702747] [2025-02-06 03:46:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:16,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:16,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:16,383 INFO L87 Difference]: Start difference. First operand 754 states and 995 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:16,492 INFO L93 Difference]: Finished difference Result 1386 states and 1823 transitions. [2025-02-06 03:46:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-02-06 03:46:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:16,495 INFO L225 Difference]: With dead ends: 1386 [2025-02-06 03:46:16,495 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 03:46:16,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:16,496 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:16,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 600 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 03:46:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-02-06 03:46:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.286775631500743) internal successors, (866), 677 states have internal predecessors, (866), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 992 transitions. [2025-02-06 03:46:16,518 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 992 transitions. Word has length 122 [2025-02-06 03:46:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 992 transitions. [2025-02-06 03:46:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 992 transitions. [2025-02-06 03:46:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:46:16,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:16,520 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:16,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:46:16,520 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1732178148, now seen corresponding path program 1 times [2025-02-06 03:46:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854642580] [2025-02-06 03:46:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:16,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:46:16,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:46:16,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854642580] [2025-02-06 03:46:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854642580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049260526] [2025-02-06 03:46:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:16,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:16,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:16,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:16,651 INFO L87 Difference]: Start difference. First operand 754 states and 992 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:16,759 INFO L93 Difference]: Finished difference Result 1386 states and 1817 transitions. [2025-02-06 03:46:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-02-06 03:46:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:16,764 INFO L225 Difference]: With dead ends: 1386 [2025-02-06 03:46:16,764 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 03:46:16,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:16,765 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:16,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 473 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 03:46:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-02-06 03:46:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2823179791976227) internal successors, (863), 677 states have internal predecessors, (863), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 989 transitions. [2025-02-06 03:46:16,790 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 989 transitions. Word has length 123 [2025-02-06 03:46:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:16,790 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 989 transitions. [2025-02-06 03:46:16,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 989 transitions. [2025-02-06 03:46:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:46:16,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:16,792 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:46:16,792 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:16,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -544007126, now seen corresponding path program 1 times [2025-02-06 03:46:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940940546] [2025-02-06 03:46:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:46:16,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:46:16,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:16,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:16,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940940546] [2025-02-06 03:46:16,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940940546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:16,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:16,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128962082] [2025-02-06 03:46:16,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:16,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:16,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:16,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:16,960 INFO L87 Difference]: Start difference. First operand 754 states and 989 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:17,074 INFO L93 Difference]: Finished difference Result 1386 states and 1811 transitions. [2025-02-06 03:46:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2025-02-06 03:46:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:17,078 INFO L225 Difference]: With dead ends: 1386 [2025-02-06 03:46:17,078 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 03:46:17,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:17,079 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:17,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 590 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 03:46:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-02-06 03:46:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2778603268945021) internal successors, (860), 677 states have internal predecessors, (860), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 986 transitions. [2025-02-06 03:46:17,105 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 986 transitions. Word has length 124 [2025-02-06 03:46:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:17,105 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 986 transitions. [2025-02-06 03:46:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 986 transitions. [2025-02-06 03:46:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:46:17,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:17,106 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:17,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:46:17,106 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1954446035, now seen corresponding path program 1 times [2025-02-06 03:46:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024030372] [2025-02-06 03:46:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:17,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:46:17,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:46:17,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:17,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024030372] [2025-02-06 03:46:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024030372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845389370] [2025-02-06 03:46:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:17,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:17,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:17,249 INFO L87 Difference]: Start difference. First operand 754 states and 986 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:17,313 INFO L93 Difference]: Finished difference Result 1563 states and 2025 transitions. [2025-02-06 03:46:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2025-02-06 03:46:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:17,317 INFO L225 Difference]: With dead ends: 1563 [2025-02-06 03:46:17,317 INFO L226 Difference]: Without dead ends: 935 [2025-02-06 03:46:17,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 03:46:17,318 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 106 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 541 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-02-06 03:46:17,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 541 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-06 03:46:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 785. [2025-02-06 03:46:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 704 states have (on average 1.2798295454545454) internal successors, (901), 708 states have internal predecessors, (901), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1027 transitions. [2025-02-06 03:46:17,348 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1027 transitions. Word has length 126 [2025-02-06 03:46:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:17,348 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1027 transitions. [2025-02-06 03:46:17,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1027 transitions. [2025-02-06 03:46:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:46:17,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:17,350 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:17,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:46:17,350 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:17,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1151914475, now seen corresponding path program 1 times [2025-02-06 03:46:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:17,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032111296] [2025-02-06 03:46:17,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:17,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:46:17,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:46:17,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:17,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:46:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032111296] [2025-02-06 03:46:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032111296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838451786] [2025-02-06 03:46:17,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:17,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:17,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:46:17,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:46:17,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:46:17,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:17,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:17,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:46:17,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:17,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:46:18,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:46:18,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 03:46:18,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2025-02-06 03:46:18,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 48 [2025-02-06 03:46:18,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2025-02-06 03:46:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:46:18,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838451786] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 7] total 17 [2025-02-06 03:46:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061733106] [2025-02-06 03:46:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:18,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:46:18,764 INFO L87 Difference]: Start difference. First operand 785 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:18,889 INFO L93 Difference]: Finished difference Result 1745 states and 2234 transitions. [2025-02-06 03:46:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:18,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2025-02-06 03:46:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:18,892 INFO L225 Difference]: With dead ends: 1745 [2025-02-06 03:46:18,892 INFO L226 Difference]: Without dead ends: 1089 [2025-02-06 03:46:18,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:46:18,894 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 60 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:18,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 387 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-06 03:46:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 926. [2025-02-06 03:46:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 845 states have (on average 1.2662721893491125) internal successors, (1070), 849 states have internal predecessors, (1070), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1196 transitions. [2025-02-06 03:46:18,918 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1196 transitions. Word has length 126 [2025-02-06 03:46:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:18,919 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1196 transitions. [2025-02-06 03:46:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1196 transitions. [2025-02-06 03:46:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:46:18,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:18,920 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:18,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:46:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:19,124 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1131269709, now seen corresponding path program 1 times [2025-02-06 03:46:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203344793] [2025-02-06 03:46:19,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:46:19,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:46:19,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:19,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203344793] [2025-02-06 03:46:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203344793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648482687] [2025-02-06 03:46:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:19,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:19,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:19,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:19,489 INFO L87 Difference]: Start difference. First operand 926 states and 1196 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:19,630 INFO L93 Difference]: Finished difference Result 2216 states and 2832 transitions. [2025-02-06 03:46:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:46:19,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2025-02-06 03:46:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:19,635 INFO L225 Difference]: With dead ends: 2216 [2025-02-06 03:46:19,635 INFO L226 Difference]: Without dead ends: 1444 [2025-02-06 03:46:19,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:19,637 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 292 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:19,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 428 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-02-06 03:46:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1039. [2025-02-06 03:46:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 958 states have (on average 1.2745302713987474) internal successors, (1221), 962 states have internal predecessors, (1221), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 03:46:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1347 transitions. [2025-02-06 03:46:19,664 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1347 transitions. Word has length 128 [2025-02-06 03:46:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:19,665 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1347 transitions. [2025-02-06 03:46:19,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1347 transitions. [2025-02-06 03:46:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:46:19,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:19,666 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:46:19,666 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:19,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1461035470, now seen corresponding path program 1 times [2025-02-06 03:46:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876854894] [2025-02-06 03:46:19,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:19,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:46:19,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:46:19,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:19,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876854894] [2025-02-06 03:46:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876854894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948976498] [2025-02-06 03:46:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:19,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:19,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:19,814 INFO L87 Difference]: Start difference. First operand 1039 states and 1347 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:19,903 INFO L93 Difference]: Finished difference Result 2452 states and 3167 transitions. [2025-02-06 03:46:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2025-02-06 03:46:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:19,908 INFO L225 Difference]: With dead ends: 2452 [2025-02-06 03:46:19,908 INFO L226 Difference]: Without dead ends: 1588 [2025-02-06 03:46:19,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:19,909 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 132 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:19,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 479 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-02-06 03:46:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1331. [2025-02-06 03:46:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.285598705501618) internal successors, (1589), 1242 states have internal predecessors, (1589), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1735 transitions. [2025-02-06 03:46:19,946 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1735 transitions. Word has length 128 [2025-02-06 03:46:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:19,947 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1735 transitions. [2025-02-06 03:46:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1735 transitions. [2025-02-06 03:46:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:46:19,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:19,949 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:19,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:46:19,949 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:19,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2067752010, now seen corresponding path program 1 times [2025-02-06 03:46:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889645419] [2025-02-06 03:46:19,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:19,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:46:19,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:46:19,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889645419] [2025-02-06 03:46:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889645419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849198101] [2025-02-06 03:46:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:20,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:20,040 INFO L87 Difference]: Start difference. First operand 1331 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:20,094 INFO L93 Difference]: Finished difference Result 2486 states and 3225 transitions. [2025-02-06 03:46:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:20,094 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2025-02-06 03:46:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:20,098 INFO L225 Difference]: With dead ends: 2486 [2025-02-06 03:46:20,098 INFO L226 Difference]: Without dead ends: 1335 [2025-02-06 03:46:20,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:20,099 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 94 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:20,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 389 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-06 03:46:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-02-06 03:46:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.272653721682848) internal successors, (1573), 1242 states have internal predecessors, (1573), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1719 transitions. [2025-02-06 03:46:20,129 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1719 transitions. Word has length 129 [2025-02-06 03:46:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1719 transitions. [2025-02-06 03:46:20,129 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1719 transitions. [2025-02-06 03:46:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:46:20,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:20,131 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:46:20,131 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:20,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash 571205173, now seen corresponding path program 1 times [2025-02-06 03:46:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843065960] [2025-02-06 03:46:20,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:20,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:46:20,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:46:20,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:20,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843065960] [2025-02-06 03:46:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843065960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887136296] [2025-02-06 03:46:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:20,214 INFO L87 Difference]: Start difference. First operand 1331 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:20,269 INFO L93 Difference]: Finished difference Result 2510 states and 3241 transitions. [2025-02-06 03:46:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:20,269 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 132 [2025-02-06 03:46:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:20,274 INFO L225 Difference]: With dead ends: 2510 [2025-02-06 03:46:20,274 INFO L226 Difference]: Without dead ends: 1335 [2025-02-06 03:46:20,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:20,276 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 95 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 379 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-06 03:46:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-02-06 03:46:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2597087378640777) internal successors, (1557), 1242 states have internal predecessors, (1557), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1703 transitions. [2025-02-06 03:46:20,329 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1703 transitions. Word has length 132 [2025-02-06 03:46:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1703 transitions. [2025-02-06 03:46:20,329 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1703 transitions. [2025-02-06 03:46:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:46:20,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:20,331 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:46:20,331 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1572071745, now seen corresponding path program 1 times [2025-02-06 03:46:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488027604] [2025-02-06 03:46:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:46:20,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:46:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:20,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488027604] [2025-02-06 03:46:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488027604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:46:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805910471] [2025-02-06 03:46:20,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:20,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:20,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:46:20,437 INFO L87 Difference]: Start difference. First operand 1331 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:20,544 INFO L93 Difference]: Finished difference Result 2510 states and 3217 transitions. [2025-02-06 03:46:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 133 [2025-02-06 03:46:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:20,548 INFO L225 Difference]: With dead ends: 2510 [2025-02-06 03:46:20,548 INFO L226 Difference]: Without dead ends: 1335 [2025-02-06 03:46:20,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 03:46:20,550 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 93 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:20,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 482 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-06 03:46:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-02-06 03:46:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2467637540453074) internal successors, (1541), 1242 states have internal predecessors, (1541), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1687 transitions. [2025-02-06 03:46:20,580 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1687 transitions. Word has length 133 [2025-02-06 03:46:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:20,580 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1687 transitions. [2025-02-06 03:46:20,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1687 transitions. [2025-02-06 03:46:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:46:20,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:20,582 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:20,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:46:20,582 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1019561488, now seen corresponding path program 1 times [2025-02-06 03:46:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598339399] [2025-02-06 03:46:20,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:20,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:46:20,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:46:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598339399] [2025-02-06 03:46:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598339399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:20,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811626251] [2025-02-06 03:46:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:20,707 INFO L87 Difference]: Start difference. First operand 1331 states and 1687 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:20,816 INFO L93 Difference]: Finished difference Result 2486 states and 3153 transitions. [2025-02-06 03:46:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 134 [2025-02-06 03:46:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:20,821 INFO L225 Difference]: With dead ends: 2486 [2025-02-06 03:46:20,821 INFO L226 Difference]: Without dead ends: 1335 [2025-02-06 03:46:20,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:46:20,822 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 90 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:20,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 604 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-06 03:46:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-02-06 03:46:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2338187702265373) internal successors, (1525), 1242 states have internal predecessors, (1525), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1671 transitions. [2025-02-06 03:46:20,857 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1671 transitions. Word has length 134 [2025-02-06 03:46:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:20,858 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1671 transitions. [2025-02-06 03:46:20,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1671 transitions. [2025-02-06 03:46:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:46:20,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:20,859 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:46:20,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 03:46:20,859 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1773065683, now seen corresponding path program 1 times [2025-02-06 03:46:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588286314] [2025-02-06 03:46:20,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:46:20,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:46:20,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:20,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:46:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588286314] [2025-02-06 03:46:21,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588286314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:21,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:46:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70536963] [2025-02-06 03:46:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:21,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:46:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:21,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:46:21,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:46:21,416 INFO L87 Difference]: Start difference. First operand 1331 states and 1671 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:21,886 INFO L93 Difference]: Finished difference Result 3409 states and 4233 transitions. [2025-02-06 03:46:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:46:21,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2025-02-06 03:46:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:21,897 INFO L225 Difference]: With dead ends: 3409 [2025-02-06 03:46:21,897 INFO L226 Difference]: Without dead ends: 2307 [2025-02-06 03:46:21,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:46:21,900 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 174 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:21,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2368 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:46:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-06 03:46:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1280. [2025-02-06 03:46:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1185 states have (on average 1.2379746835443037) internal successors, (1467), 1191 states have internal predecessors, (1467), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1613 transitions. [2025-02-06 03:46:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1613 transitions. Word has length 136 [2025-02-06 03:46:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1613 transitions. [2025-02-06 03:46:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1613 transitions. [2025-02-06 03:46:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 03:46:21,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:21,941 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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] [2025-02-06 03:46:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 03:46:21,941 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 524155991, now seen corresponding path program 1 times [2025-02-06 03:46:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413385273] [2025-02-06 03:46:21,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:21,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 03:46:22,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 03:46:22,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:22,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 42 proven. 66 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2025-02-06 03:46:22,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413385273] [2025-02-06 03:46:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413385273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837768649] [2025-02-06 03:46:22,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:22,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:22,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:46:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 03:46:22,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 03:46:22,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:22,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:22,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:46:22,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:22,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:46:22,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2025-02-06 03:46:22,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-06 03:46:22,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-06 03:46:23,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-02-06 03:46:23,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:46:23,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2025-02-06 03:46:23,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-06 03:46:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 13 proven. 692 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2025-02-06 03:46:23,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-02-06 03:46:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837768649] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:23,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:46:23,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 7] total 17 [2025-02-06 03:46:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863677599] [2025-02-06 03:46:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:46:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:23,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:46:23,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:46:23,384 INFO L87 Difference]: Start difference. First operand 1280 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:23,590 INFO L93 Difference]: Finished difference Result 2026 states and 2580 transitions. [2025-02-06 03:46:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:46:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 221 [2025-02-06 03:46:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:23,602 INFO L225 Difference]: With dead ends: 2026 [2025-02-06 03:46:23,606 INFO L226 Difference]: Without dead ends: 1439 [2025-02-06 03:46:23,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:46:23,608 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 148 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:23,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 389 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:46:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-06 03:46:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1260. [2025-02-06 03:46:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1165 states have (on average 1.226609442060086) internal successors, (1429), 1171 states have internal predecessors, (1429), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1575 transitions. [2025-02-06 03:46:23,674 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1575 transitions. Word has length 221 [2025-02-06 03:46:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1575 transitions. [2025-02-06 03:46:23,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1575 transitions. [2025-02-06 03:46:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 03:46:23,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:23,678 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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] [2025-02-06 03:46:23,689 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-02-06 03:46:23,882 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,SelfDestructingSolverStorable37 [2025-02-06 03:46:23,882 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:23,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1679984983, now seen corresponding path program 1 times [2025-02-06 03:46:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130361447] [2025-02-06 03:46:23,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:23,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 03:46:23,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 03:46:23,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:23,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2025-02-06 03:46:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:24,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130361447] [2025-02-06 03:46:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130361447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:46:24,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007356213] [2025-02-06 03:46:24,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:46:24,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:46:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:46:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 03:46:24,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 03:46:24,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:24,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:24,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:46:24,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:46:24,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:46:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 717 proven. 144 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-06 03:46:24,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:46:24,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-02-06 03:46:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2025-02-06 03:46:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007356213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:46:24,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:46:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-02-06 03:46:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091395458] [2025-02-06 03:46:24,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:46:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:46:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:24,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:46:24,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:46:24,935 INFO L87 Difference]: Start difference. First operand 1260 states and 1575 transitions. Second operand has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) [2025-02-06 03:46:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:25,225 INFO L93 Difference]: Finished difference Result 2300 states and 2864 transitions. [2025-02-06 03:46:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:46:25,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) Word has length 221 [2025-02-06 03:46:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:25,229 INFO L225 Difference]: With dead ends: 2300 [2025-02-06 03:46:25,229 INFO L226 Difference]: Without dead ends: 1218 [2025-02-06 03:46:25,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:46:25,233 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 220 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:25,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 753 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-02-06 03:46:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1194. [2025-02-06 03:46:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1090 states have (on average 1.2155963302752293) internal successors, (1325), 1096 states have internal predecessors, (1325), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1471 transitions. [2025-02-06 03:46:25,277 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1471 transitions. Word has length 221 [2025-02-06 03:46:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1471 transitions. [2025-02-06 03:46:25,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) [2025-02-06 03:46:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1471 transitions. [2025-02-06 03:46:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 03:46:25,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:25,280 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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] [2025-02-06 03:46:25,288 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-02-06 03:46:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:46:25,481 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:25,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 633607385, now seen corresponding path program 1 times [2025-02-06 03:46:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:25,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142577847] [2025-02-06 03:46:25,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:25,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 03:46:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 03:46:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:25,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-02-06 03:46:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:26,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142577847] [2025-02-06 03:46:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142577847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:46:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474610881] [2025-02-06 03:46:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:26,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:46:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:26,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:46:26,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:46:26,508 INFO L87 Difference]: Start difference. First operand 1194 states and 1471 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:26,897 INFO L93 Difference]: Finished difference Result 1721 states and 2150 transitions. [2025-02-06 03:46:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:46:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 221 [2025-02-06 03:46:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:26,901 INFO L225 Difference]: With dead ends: 1721 [2025-02-06 03:46:26,901 INFO L226 Difference]: Without dead ends: 1172 [2025-02-06 03:46:26,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:46:26,902 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 214 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:26,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 637 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:46:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-06 03:46:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2025-02-06 03:46:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1066 states have (on average 1.199812382739212) internal successors, (1279), 1072 states have internal predecessors, (1279), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1425 transitions. [2025-02-06 03:46:26,943 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1425 transitions. Word has length 221 [2025-02-06 03:46:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1425 transitions. [2025-02-06 03:46:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1425 transitions. [2025-02-06 03:46:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-06 03:46:26,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:26,946 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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] [2025-02-06 03:46:26,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 03:46:26,946 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1138289907, now seen corresponding path program 1 times [2025-02-06 03:46:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183207214] [2025-02-06 03:46:26,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:26,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 03:46:26,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 03:46:26,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:26,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:46:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2025-02-06 03:46:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:46:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183207214] [2025-02-06 03:46:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183207214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:46:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:46:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:46:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600399163] [2025-02-06 03:46:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:46:27,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:46:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:46:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:46:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:46:27,027 INFO L87 Difference]: Start difference. First operand 1170 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:46:27,082 INFO L93 Difference]: Finished difference Result 2372 states and 2933 transitions. [2025-02-06 03:46:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:46:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 223 [2025-02-06 03:46:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:46:27,085 INFO L225 Difference]: With dead ends: 2372 [2025-02-06 03:46:27,086 INFO L226 Difference]: Without dead ends: 1393 [2025-02-06 03:46:27,087 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-02-06 03:46:27,087 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:46:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:46:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-02-06 03:46:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1106. [2025-02-06 03:46:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1002 states have (on average 1.2055888223552895) internal successors, (1208), 1008 states have internal predecessors, (1208), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:46:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1354 transitions. [2025-02-06 03:46:27,129 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1354 transitions. Word has length 223 [2025-02-06 03:46:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:46:27,129 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1354 transitions. [2025-02-06 03:46:27,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 03:46:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1354 transitions. [2025-02-06 03:46:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-06 03:46:27,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:46:27,131 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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] [2025-02-06 03:46:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 03:46:27,131 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:46:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:46:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 70684145, now seen corresponding path program 1 times [2025-02-06 03:46:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:46:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485052606] [2025-02-06 03:46:27,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:46:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:46:27,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-06 03:46:27,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-06 03:46:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:46:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat