./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.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-53.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 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:41:18,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:41:18,097 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:41:18,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:41:18,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:41:18,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:41:18,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:41:18,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:41:18,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:41:18,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:41:18,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:41:18,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:41:18,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:41:18,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:41:18,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:41:18,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:41:18,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:41:18,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:41:18,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:41:18,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:41:18,132 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 -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2025-02-06 03:41:18,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:41:18,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:41:18,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:41:18,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:41:18,432 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:41:18,433 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-53.i [2025-02-06 03:41:19,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba20669f/dbca65d5416b44ffa09a6fcd15fbc60c/FLAGbf1d380d5 [2025-02-06 03:41:20,059 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:41:20,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2025-02-06 03:41:20,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba20669f/dbca65d5416b44ffa09a6fcd15fbc60c/FLAGbf1d380d5 [2025-02-06 03:41:20,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba20669f/dbca65d5416b44ffa09a6fcd15fbc60c [2025-02-06 03:41:20,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:41:20,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:41:20,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:41:20,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:41:20,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:41:20,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20, skipping insertion in model container [2025-02-06 03:41:20,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:41:20,235 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-53.i[916,929] [2025-02-06 03:41:20,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:41:20,294 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:41:20,303 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-53.i[916,929] [2025-02-06 03:41:20,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:41:20,362 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:41:20,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20 WrapperNode [2025-02-06 03:41:20,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:41:20,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:41:20,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:41:20,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:41:20,370 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:41:20" (1/1) ... [2025-02-06 03:41:20,380 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:41:20" (1/1) ... [2025-02-06 03:41:20,426 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2025-02-06 03:41:20,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:41:20,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:41:20,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:41:20,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:41:20,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,469 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2025-02-06 03:41:20,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:41:20,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:41:20,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:41:20,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:41:20,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (1/1) ... [2025-02-06 03:41:20,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:41:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:20,556 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:41:20,561 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:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:41:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:41:20,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:41:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:41:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:41:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:41:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 03:41:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:41:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:41:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 03:41:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:41:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:41:20,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:41:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:41:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:41:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:41:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:41:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:41:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:41:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 03:41:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:41:20,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:41:20,801 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:41:20,802 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:41:21,307 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-02-06 03:41:21,374 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-06 03:41:21,374 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:41:21,385 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:41:21,388 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:41:21,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:41:21 BoogieIcfgContainer [2025-02-06 03:41:21,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:41:21,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:41:21,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:41:21,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:41:21,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:41:20" (1/3) ... [2025-02-06 03:41:21,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f19203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:41:21, skipping insertion in model container [2025-02-06 03:41:21,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:41:20" (2/3) ... [2025-02-06 03:41:21,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f19203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:41:21, skipping insertion in model container [2025-02-06 03:41:21,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:41:21" (3/3) ... [2025-02-06 03:41:21,399 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2025-02-06 03:41:21,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:41:21,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:41:21,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:41:21,486 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;@2398a912, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:41:21,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:41:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:41:21,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:21,507 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1784361753, now seen corresponding path program 1 times [2025-02-06 03:41:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-02-06 03:41:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:41:21,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:41:21,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:41:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-02-06 03:41:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947834570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96852684] [2025-02-06 03:41:21,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:21,971 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:41:21,974 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:41:22,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:41:22,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:41:22,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:22,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:22,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:41:22,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:41:22,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96852684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:22,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:41:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86571895] [2025-02-06 03:41:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:22,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:41:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:22,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:41:22,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:41:22,362 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:41:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:22,391 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-02-06 03:41:22,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:41:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-02-06 03:41:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:22,400 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:41:22,401 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:41:22,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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:41:22,409 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:22,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:41:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:41:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-02-06 03:41:22,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-02-06 03:41:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:22,451 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-02-06 03:41:22,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:41:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-02-06 03:41:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:41:22,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:22,454 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:22,464 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:41:22,655 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:41:22,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:22,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1855035319, now seen corresponding path program 1 times [2025-02-06 03:41:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-02-06 03:41:22,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:22,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:41:22,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:41:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:22,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-02-06 03:41:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191383406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:41:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958933275] [2025-02-06 03:41:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:41:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:41:23,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:41:23,363 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:23,417 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2025-02-06 03:41:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:41:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-02-06 03:41:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:23,420 INFO L225 Difference]: With dead ends: 213 [2025-02-06 03:41:23,422 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:41:23,423 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:41:23,424 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:23,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:41:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:41:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-02-06 03:41:23,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2025-02-06 03:41:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:23,441 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-02-06 03:41:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-02-06 03:41:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:41:23,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:23,444 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:41:23,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1929397800, now seen corresponding path program 1 times [2025-02-06 03:41:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525386528] [2025-02-06 03:41:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:23,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:41:23,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:41:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525386528] [2025-02-06 03:41:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525386528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:41:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563776761] [2025-02-06 03:41:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:41:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:24,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:41:24,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:41:24,967 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:25,291 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2025-02-06 03:41:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:41:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2025-02-06 03:41:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:25,297 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:41:25,297 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:41:25,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:41:25,298 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 216 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:25,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 546 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:41:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 03:41:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-02-06 03:41:25,323 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2025-02-06 03:41:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:25,324 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-02-06 03:41:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-02-06 03:41:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:41:25,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:25,329 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:41:25,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 132446441, now seen corresponding path program 1 times [2025-02-06 03:41:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122580125] [2025-02-06 03:41:25,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:25,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:41:25,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:41:25,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:25,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122580125] [2025-02-06 03:41:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122580125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:41:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692344924] [2025-02-06 03:41:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:26,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:41:26,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:26,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:41:26,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:26,391 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:26,648 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2025-02-06 03:41:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:41:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-02-06 03:41:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:26,652 INFO L225 Difference]: With dead ends: 336 [2025-02-06 03:41:26,654 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 03:41:26,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:26,656 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 154 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:26,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 588 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 03:41:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2025-02-06 03:41:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:41:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2025-02-06 03:41:26,695 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2025-02-06 03:41:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2025-02-06 03:41:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2025-02-06 03:41:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:41:26,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:26,698 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:41:26,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 43742796, now seen corresponding path program 1 times [2025-02-06 03:41:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994766081] [2025-02-06 03:41:26,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:26,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:41:26,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:41:26,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:26,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994766081] [2025-02-06 03:41:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994766081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:41:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641983767] [2025-02-06 03:41:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:41:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:41:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:41:28,029 INFO L87 Difference]: Start difference. First operand 219 states and 308 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:28,395 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2025-02-06 03:41:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:41:28,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-02-06 03:41:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:28,399 INFO L225 Difference]: With dead ends: 330 [2025-02-06 03:41:28,399 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 03:41:28,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:41:28,402 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 291 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:28,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 515 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:41:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 03:41:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2025-02-06 03:41:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2025-02-06 03:41:28,426 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2025-02-06 03:41:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2025-02-06 03:41:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2025-02-06 03:41:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:41:28,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:28,428 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:41:28,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 458370098, now seen corresponding path program 1 times [2025-02-06 03:41:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:28,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687860375] [2025-02-06 03:41:28,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:41:28,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:41:28,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:28,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687860375] [2025-02-06 03:41:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687860375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:41:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398093426] [2025-02-06 03:41:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:28,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:41:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:28,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:41:28,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:41:28,682 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:28,722 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2025-02-06 03:41:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:41:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:41:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:28,724 INFO L225 Difference]: With dead ends: 221 [2025-02-06 03:41:28,726 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:41:28,726 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:41:28,726 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 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:41:28,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:41:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:41:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:41:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2025-02-06 03:41:28,765 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2025-02-06 03:41:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:28,766 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2025-02-06 03:41:28,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2025-02-06 03:41:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:41:28,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:28,768 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:41:28,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:28,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 164967091, now seen corresponding path program 1 times [2025-02-06 03:41:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636055758] [2025-02-06 03:41:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:41:28,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:41:28,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:28,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:29,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636055758] [2025-02-06 03:41:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636055758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:41:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522365399] [2025-02-06 03:41:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:29,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:41:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:29,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:41:29,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:41:29,721 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:30,155 INFO L93 Difference]: Finished difference Result 299 states and 409 transitions. [2025-02-06 03:41:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:41:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-02-06 03:41:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:30,159 INFO L225 Difference]: With dead ends: 299 [2025-02-06 03:41:30,159 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:41:30,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:41:30,160 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 221 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:30,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1148 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:41:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:41:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-02-06 03:41:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:41:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2025-02-06 03:41:30,194 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2025-02-06 03:41:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2025-02-06 03:41:30,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2025-02-06 03:41:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:41:30,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:30,198 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:41:30,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:30,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -409823601, now seen corresponding path program 1 times [2025-02-06 03:41:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915560923] [2025-02-06 03:41:30,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:30,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:41:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:41:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915560923] [2025-02-06 03:41:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915560923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:41:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355585004] [2025-02-06 03:41:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:41:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:31,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:41:31,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:41:31,504 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:32,417 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2025-02-06 03:41:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:41:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-02-06 03:41:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:32,423 INFO L225 Difference]: With dead ends: 607 [2025-02-06 03:41:32,423 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:41:32,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:41:32,425 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 234 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:32,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1567 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:41:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:41:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2025-02-06 03:41:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2025-02-06 03:41:32,516 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2025-02-06 03:41:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2025-02-06 03:41:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2025-02-06 03:41:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:41:32,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:32,519 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:32,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:41:32,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2088192336, now seen corresponding path program 1 times [2025-02-06 03:41:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646369405] [2025-02-06 03:41:32,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:32,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:32,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:41:32,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:41:32,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:32,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646369405] [2025-02-06 03:41:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646369405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:33,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:41:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009324818] [2025-02-06 03:41:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:33,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:41:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:33,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:41:33,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:41:33,600 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:34,175 INFO L93 Difference]: Finished difference Result 947 states and 1296 transitions. [2025-02-06 03:41:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:41:34,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-02-06 03:41:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:34,179 INFO L225 Difference]: With dead ends: 947 [2025-02-06 03:41:34,180 INFO L226 Difference]: Without dead ends: 534 [2025-02-06 03:41:34,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:41:34,181 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 237 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:34,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 914 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:41:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-06 03:41:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-02-06 03:41:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2941176470588236) internal successors, (484), 377 states have internal predecessors, (484), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 600 transitions. [2025-02-06 03:41:34,246 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 600 transitions. Word has length 146 [2025-02-06 03:41:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:34,247 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 600 transitions. [2025-02-06 03:41:34,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 600 transitions. [2025-02-06 03:41:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:41:34,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:34,249 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:41:34,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash -818647826, now seen corresponding path program 1 times [2025-02-06 03:41:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504966242] [2025-02-06 03:41:34,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:34,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:41:34,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:41:34,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:34,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504966242] [2025-02-06 03:41:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504966242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:41:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509311579] [2025-02-06 03:41:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:41:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:35,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:41:35,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:41:35,715 INFO L87 Difference]: Start difference. First operand 442 states and 600 transitions. Second operand has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:36,625 INFO L93 Difference]: Finished difference Result 918 states and 1243 transitions. [2025-02-06 03:41:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:41:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 146 [2025-02-06 03:41:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:36,629 INFO L225 Difference]: With dead ends: 918 [2025-02-06 03:41:36,629 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 03:41:36,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:41:36,631 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 259 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:36,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1714 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:41:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 03:41:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 442. [2025-02-06 03:41:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2887700534759359) internal successors, (482), 377 states have internal predecessors, (482), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 598 transitions. [2025-02-06 03:41:36,693 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 598 transitions. Word has length 146 [2025-02-06 03:41:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:36,693 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 598 transitions. [2025-02-06 03:41:36,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 598 transitions. [2025-02-06 03:41:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:41:36,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:36,695 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:41:36,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1679368111, now seen corresponding path program 1 times [2025-02-06 03:41:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-02-06 03:41:36,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:36,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:41:36,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:41:36,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:36,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-02-06 03:41:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970676162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:37,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:37,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:41:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795564356] [2025-02-06 03:41:37,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:37,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:41:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:37,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:41:37,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:41:37,483 INFO L87 Difference]: Start difference. First operand 442 states and 598 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:41:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:38,016 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2025-02-06 03:41:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:41:38,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-02-06 03:41:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:38,021 INFO L225 Difference]: With dead ends: 889 [2025-02-06 03:41:38,021 INFO L226 Difference]: Without dead ends: 450 [2025-02-06 03:41:38,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:41:38,023 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 200 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:38,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1408 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:41:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-06 03:41:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 442. [2025-02-06 03:41:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.286096256684492) internal successors, (481), 377 states have internal predecessors, (481), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 597 transitions. [2025-02-06 03:41:38,075 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 597 transitions. Word has length 146 [2025-02-06 03:41:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:38,075 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 597 transitions. [2025-02-06 03:41:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:41:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 597 transitions. [2025-02-06 03:41:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:41:38,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:38,078 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:41:38,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2140051041, now seen corresponding path program 1 times [2025-02-06 03:41:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913728112] [2025-02-06 03:41:38,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:38,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:41:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:41:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913728112] [2025-02-06 03:41:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913728112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081196992] [2025-02-06 03:41:38,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:38,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:38,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:38,318 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:41:38,320 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:41:38,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:41:38,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:41:38,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:38,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:38,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:41:38,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:38,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081196992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:38,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:41:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145844540] [2025-02-06 03:41:38,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:38,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:41:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:41:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:41:38,701 INFO L87 Difference]: Start difference. First operand 442 states and 597 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:38,796 INFO L93 Difference]: Finished difference Result 901 states and 1216 transitions. [2025-02-06 03:41:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:41:38,797 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-02-06 03:41:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:38,800 INFO L225 Difference]: With dead ends: 901 [2025-02-06 03:41:38,800 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 03:41:38,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 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:41:38,802 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 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:41:38,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 03:41:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 456. [2025-02-06 03:41:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 388 states have (on average 1.2757731958762886) internal successors, (495), 391 states have internal predecessors, (495), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 611 transitions. [2025-02-06 03:41:38,866 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 611 transitions. Word has length 147 [2025-02-06 03:41:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 611 transitions. [2025-02-06 03:41:38,866 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 611 transitions. [2025-02-06 03:41:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:41:38,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:38,868 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:38,878 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:41:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:39,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:39,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1041979725, now seen corresponding path program 1 times [2025-02-06 03:41:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36006772] [2025-02-06 03:41:39,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:39,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:41:39,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:41:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36006772] [2025-02-06 03:41:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36006772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856634343] [2025-02-06 03:41:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:39,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:39,261 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:41:39,264 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:41:39,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:41:39,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:41:39,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:39,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:39,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:41:39,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:39,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856634343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:41:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578342865] [2025-02-06 03:41:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:41:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:39,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:41:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:41:39,578 INFO L87 Difference]: Start difference. First operand 456 states and 611 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:39,634 INFO L93 Difference]: Finished difference Result 924 states and 1239 transitions. [2025-02-06 03:41:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:41:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-02-06 03:41:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:39,638 INFO L225 Difference]: With dead ends: 924 [2025-02-06 03:41:39,638 INFO L226 Difference]: Without dead ends: 471 [2025-02-06 03:41:39,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 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:41:39,642 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:39,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-06 03:41:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-02-06 03:41:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 403 states have (on average 1.2655086848635235) internal successors, (510), 406 states have internal predecessors, (510), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:41:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2025-02-06 03:41:39,688 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 147 [2025-02-06 03:41:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:39,689 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2025-02-06 03:41:39,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2025-02-06 03:41:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:41:39,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:39,691 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:39,700 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:41:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:39,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1639988658, now seen corresponding path program 1 times [2025-02-06 03:41:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376834556] [2025-02-06 03:41:39,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:41:39,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:41:39,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:39,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:42,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376834556] [2025-02-06 03:41:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376834556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:42,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 03:41:42,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259804506] [2025-02-06 03:41:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:42,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:41:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:42,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:41:42,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:41:42,023 INFO L87 Difference]: Start difference. First operand 471 states and 626 transitions. Second operand has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 03:41:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:43,598 INFO L93 Difference]: Finished difference Result 734 states and 973 transitions. [2025-02-06 03:41:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:41:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 148 [2025-02-06 03:41:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:43,602 INFO L225 Difference]: With dead ends: 734 [2025-02-06 03:41:43,602 INFO L226 Difference]: Without dead ends: 519 [2025-02-06 03:41:43,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:41:43,604 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 389 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:43,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1639 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:41:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-06 03:41:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2025-02-06 03:41:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 442 states have (on average 1.2647058823529411) internal successors, (559), 446 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 679 transitions. [2025-02-06 03:41:43,670 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 679 transitions. Word has length 148 [2025-02-06 03:41:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 679 transitions. [2025-02-06 03:41:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 03:41:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 679 transitions. [2025-02-06 03:41:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:41:43,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:43,673 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:41:43,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1231164433, now seen corresponding path program 1 times [2025-02-06 03:41:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597583493] [2025-02-06 03:41:43,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:43,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:41:43,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:41:43,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:44,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597583493] [2025-02-06 03:41:44,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597583493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:44,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:44,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:41:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947552957] [2025-02-06 03:41:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:44,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:41:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:41:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:41:44,902 INFO L87 Difference]: Start difference. First operand 513 states and 679 transitions. Second operand has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:45,863 INFO L93 Difference]: Finished difference Result 844 states and 1117 transitions. [2025-02-06 03:41:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:41:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-02-06 03:41:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:45,867 INFO L225 Difference]: With dead ends: 844 [2025-02-06 03:41:45,867 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 03:41:45,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:41:45,870 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 439 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:45,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1560 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:41:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 03:41:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-02-06 03:41:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 444 states have (on average 1.2635135135135136) internal successors, (561), 448 states have internal predecessors, (561), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 681 transitions. [2025-02-06 03:41:45,940 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 681 transitions. Word has length 148 [2025-02-06 03:41:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:45,941 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 681 transitions. [2025-02-06 03:41:45,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2025-02-06 03:41:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:41:45,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:45,944 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:41:45,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:45,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -565786926, now seen corresponding path program 1 times [2025-02-06 03:41:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991510056] [2025-02-06 03:41:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:45,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:41:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:41:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:46,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991510056] [2025-02-06 03:41:47,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991510056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:47,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:47,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:41:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658203499] [2025-02-06 03:41:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:41:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:47,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:41:47,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:41:47,207 INFO L87 Difference]: Start difference. First operand 515 states and 681 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:48,074 INFO L93 Difference]: Finished difference Result 778 states and 1027 transitions. [2025-02-06 03:41:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:41:48,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-02-06 03:41:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:48,078 INFO L225 Difference]: With dead ends: 778 [2025-02-06 03:41:48,078 INFO L226 Difference]: Without dead ends: 519 [2025-02-06 03:41:48,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:41:48,079 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 372 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:48,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1395 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:41:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-06 03:41:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2025-02-06 03:41:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 443 states have (on average 1.2618510158013545) internal successors, (559), 447 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 679 transitions. [2025-02-06 03:41:48,123 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 679 transitions. Word has length 148 [2025-02-06 03:41:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:48,123 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 679 transitions. [2025-02-06 03:41:48,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:41:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 679 transitions. [2025-02-06 03:41:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:41:48,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:48,125 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:41:48,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1314523446, now seen corresponding path program 1 times [2025-02-06 03:41:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298518147] [2025-02-06 03:41:48,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:41:48,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:41:48,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:48,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298518147] [2025-02-06 03:41:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298518147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249955540] [2025-02-06 03:41:48,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:48,332 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:41:48,333 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:41:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:41:48,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:41:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:48,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:41:48,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:48,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:41:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249955540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:48,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:41:48,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-02-06 03:41:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364083945] [2025-02-06 03:41:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:48,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:41:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:48,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:41:48,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:41:48,678 INFO L87 Difference]: Start difference. First operand 514 states and 679 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:48,745 INFO L93 Difference]: Finished difference Result 1061 states and 1397 transitions. [2025-02-06 03:41:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:41:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:41:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:48,748 INFO L225 Difference]: With dead ends: 1061 [2025-02-06 03:41:48,748 INFO L226 Difference]: Without dead ends: 550 [2025-02-06 03:41:48,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:41:48,750 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:48,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:41:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-06 03:41:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2025-02-06 03:41:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 453 states have internal predecessors, (565), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 685 transitions. [2025-02-06 03:41:48,798 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 685 transitions. Word has length 149 [2025-02-06 03:41:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 685 transitions. [2025-02-06 03:41:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 685 transitions. [2025-02-06 03:41:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:41:48,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:48,802 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:41:49,002 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,SelfDestructingSolverStorable16 [2025-02-06 03:41:49,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 917887184, now seen corresponding path program 1 times [2025-02-06 03:41:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620031219] [2025-02-06 03:41:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:41:49,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:41:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620031219] [2025-02-06 03:41:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620031219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:41:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604833858] [2025-02-06 03:41:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:49,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:41:49,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:41:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:41:49,303 INFO L87 Difference]: Start difference. First operand 520 states and 685 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:49,439 INFO L93 Difference]: Finished difference Result 1219 states and 1596 transitions. [2025-02-06 03:41:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:41:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:41:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:49,443 INFO L225 Difference]: With dead ends: 1219 [2025-02-06 03:41:49,443 INFO L226 Difference]: Without dead ends: 702 [2025-02-06 03:41:49,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:41:49,445 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:49,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-06 03:41:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 586. [2025-02-06 03:41:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 513 states have (on average 1.2612085769980508) internal successors, (647), 517 states have internal predecessors, (647), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 767 transitions. [2025-02-06 03:41:49,499 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 767 transitions. Word has length 149 [2025-02-06 03:41:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:49,499 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 767 transitions. [2025-02-06 03:41:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 767 transitions. [2025-02-06 03:41:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:41:49,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:49,502 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:41:49,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:49,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -211263349, now seen corresponding path program 1 times [2025-02-06 03:41:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:49,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868969541] [2025-02-06 03:41:49,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:49,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:41:49,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:41:49,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:49,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:50,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:50,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868969541] [2025-02-06 03:41:50,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868969541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:50,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:50,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:41:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671591271] [2025-02-06 03:41:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:41:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:50,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:41:50,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:41:50,259 INFO L87 Difference]: Start difference. First operand 586 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:50,444 INFO L93 Difference]: Finished difference Result 1145 states and 1488 transitions. [2025-02-06 03:41:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:41:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:41:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:50,450 INFO L225 Difference]: With dead ends: 1145 [2025-02-06 03:41:50,450 INFO L226 Difference]: Without dead ends: 1143 [2025-02-06 03:41:50,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:41:50,451 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 96 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1085 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:41:50,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1085 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:41:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-02-06 03:41:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 829. [2025-02-06 03:41:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 756 states have (on average 1.2671957671957672) internal successors, (958), 760 states have internal predecessors, (958), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:41:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1078 transitions. [2025-02-06 03:41:50,511 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1078 transitions. Word has length 149 [2025-02-06 03:41:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:50,512 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1078 transitions. [2025-02-06 03:41:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:41:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1078 transitions. [2025-02-06 03:41:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:41:50,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:50,514 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:41:50,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:50,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1029880525, now seen corresponding path program 1 times [2025-02-06 03:41:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801501199] [2025-02-06 03:41:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:50,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:41:50,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:41:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:41:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801501199] [2025-02-06 03:41:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801501199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:41:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:41:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:41:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890111872] [2025-02-06 03:41:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:41:51,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:41:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:51,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:41:51,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:41:51,273 INFO L87 Difference]: Start difference. First operand 829 states and 1078 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:51,855 INFO L93 Difference]: Finished difference Result 1504 states and 1958 transitions. [2025-02-06 03:41:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:41:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-02-06 03:41:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:51,863 INFO L225 Difference]: With dead ends: 1504 [2025-02-06 03:41:51,863 INFO L226 Difference]: Without dead ends: 966 [2025-02-06 03:41:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:41:51,865 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 300 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2005 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:41:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-02-06 03:41:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 948. [2025-02-06 03:41:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 845 states have (on average 1.2627218934911242) internal successors, (1067), 851 states have internal predecessors, (1067), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:41:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1235 transitions. [2025-02-06 03:41:51,949 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1235 transitions. Word has length 151 [2025-02-06 03:41:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:51,949 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1235 transitions. [2025-02-06 03:41:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:41:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1235 transitions. [2025-02-06 03:41:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:41:51,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:51,951 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:41:51,951 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 557201806, now seen corresponding path program 1 times [2025-02-06 03:41:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893049021] [2025-02-06 03:41:51,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:51,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:41:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:41:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893049021] [2025-02-06 03:41:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893049021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031602835] [2025-02-06 03:41:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:52,766 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:41:52,767 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:41:52,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:41:53,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:41:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:53,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:41:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:53,334 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:41:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 03:41:54,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:54,810 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:41:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 84 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-02-06 03:41:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031602835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:54,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:41:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-02-06 03:41:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247151656] [2025-02-06 03:41:54,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:54,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 03:41:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:54,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 03:41:54,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:41:54,848 INFO L87 Difference]: Start difference. First operand 948 states and 1235 transitions. Second operand has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) [2025-02-06 03:41:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:56,427 INFO L93 Difference]: Finished difference Result 1965 states and 2530 transitions. [2025-02-06 03:41:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 03:41:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) Word has length 151 [2025-02-06 03:41:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:56,433 INFO L225 Difference]: With dead ends: 1965 [2025-02-06 03:41:56,433 INFO L226 Difference]: Without dead ends: 1020 [2025-02-06 03:41:56,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 03:41:56,437 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 872 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:56,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1755 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:41:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-02-06 03:41:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 975. [2025-02-06 03:41:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 860 states have (on average 1.255813953488372) internal successors, (1080), 866 states have internal predecessors, (1080), 84 states have call successors, (84), 30 states have call predecessors, (84), 30 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:41:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1248 transitions. [2025-02-06 03:41:56,565 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1248 transitions. Word has length 151 [2025-02-06 03:41:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:56,565 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1248 transitions. [2025-02-06 03:41:56,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 10 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (54), 8 states have call predecessors, (54), 10 states have call successors, (54) [2025-02-06 03:41:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1248 transitions. [2025-02-06 03:41:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:41:56,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:56,568 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:41:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:56,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -985449200, now seen corresponding path program 1 times [2025-02-06 03:41:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329647622] [2025-02-06 03:41:56,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:56,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:41:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:41:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:56,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:41:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329647622] [2025-02-06 03:41:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329647622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:41:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391394656] [2025-02-06 03:41:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:57,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:41:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:41:57,426 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:41:57,427 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:41:57,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:41:57,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:41:57,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:57,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:41:57,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:41:57,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:41:57,824 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:41:58,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:41:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:41:58,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:41:58,423 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:41:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:41:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391394656] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:41:58,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:41:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-02-06 03:41:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467284094] [2025-02-06 03:41:58,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:41:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:41:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:41:58,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:41:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:41:58,440 INFO L87 Difference]: Start difference. First operand 975 states and 1248 transitions. Second operand has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2025-02-06 03:41:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:41:59,354 INFO L93 Difference]: Finished difference Result 1974 states and 2502 transitions. [2025-02-06 03:41:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:41:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) Word has length 151 [2025-02-06 03:41:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:41:59,366 INFO L225 Difference]: With dead ends: 1974 [2025-02-06 03:41:59,366 INFO L226 Difference]: Without dead ends: 1002 [2025-02-06 03:41:59,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 03:41:59,380 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 431 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:41:59,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1284 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:41:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-02-06 03:41:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 950. [2025-02-06 03:41:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 827 states have (on average 1.2454655380894801) internal successors, (1030), 833 states have internal predecessors, (1030), 84 states have call successors, (84), 38 states have call predecessors, (84), 38 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:41:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1198 transitions. [2025-02-06 03:41:59,563 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1198 transitions. Word has length 151 [2025-02-06 03:41:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:41:59,564 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1198 transitions. [2025-02-06 03:41:59,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 9.166666666666666) internal successors, (165), 21 states have internal predecessors, (165), 6 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (54), 3 states have call predecessors, (54), 6 states have call successors, (54) [2025-02-06 03:41:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1198 transitions. [2025-02-06 03:41:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:41:59,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:41:59,567 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:59,578 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:41:59,767 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,SelfDestructingSolverStorable21 [2025-02-06 03:41:59,768 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:41:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:41:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash 221711416, now seen corresponding path program 1 times [2025-02-06 03:41:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:41:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714321699] [2025-02-06 03:41:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:41:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:41:59,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:41:59,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:41:59,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:41:59,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:00,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714321699] [2025-02-06 03:42:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714321699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56956091] [2025-02-06 03:42:00,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:00,257 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:42:00,260 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:42:00,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:42:00,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:42:00,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:00,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:00,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:42:00,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:00,678 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:42:00,816 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 25 treesize of output 17 [2025-02-06 03:42:00,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:42:00,863 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 17 treesize of output 9 [2025-02-06 03:42:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:42:00,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:01,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-02-06 03:42:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56956091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:42:01,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:42:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2025-02-06 03:42:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348596353] [2025-02-06 03:42:01,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:42:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:42:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:42:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:42:01,185 INFO L87 Difference]: Start difference. First operand 950 states and 1198 transitions. Second operand has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-02-06 03:42:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:01,960 INFO L93 Difference]: Finished difference Result 1841 states and 2291 transitions. [2025-02-06 03:42:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:42:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) Word has length 152 [2025-02-06 03:42:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:01,964 INFO L225 Difference]: With dead ends: 1841 [2025-02-06 03:42:01,964 INFO L226 Difference]: Without dead ends: 894 [2025-02-06 03:42:01,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:42:01,966 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 546 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 753 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:42:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-02-06 03:42:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 864. [2025-02-06 03:42:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 735 states have (on average 1.2081632653061225) internal successors, (888), 741 states have internal predecessors, (888), 84 states have call successors, (84), 44 states have call predecessors, (84), 44 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:42:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1056 transitions. [2025-02-06 03:42:02,111 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1056 transitions. Word has length 152 [2025-02-06 03:42:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:02,112 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1056 transitions. [2025-02-06 03:42:02,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.6) internal successors, (129), 18 states have internal predecessors, (129), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2025-02-06 03:42:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1056 transitions. [2025-02-06 03:42:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:42:02,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:02,113 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:02,315 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1651651696, now seen corresponding path program 1 times [2025-02-06 03:42:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577969944] [2025-02-06 03:42:02,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:42:02,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:42:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-02-06 03:42:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577969944] [2025-02-06 03:42:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577969944] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992641332] [2025-02-06 03:42:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:03,568 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:03,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:42:03,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:42:04,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:42:04,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:04,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:04,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 03:42:04,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:04,641 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 23 treesize of output 3 [2025-02-06 03:42:05,034 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:42:05,690 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:42:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 496 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 03:42:06,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:06,649 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 64 treesize of output 60 [2025-02-06 03:42:07,716 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 154 treesize of output 142