./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.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 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:49:36,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:49:36,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:49:36,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:49:36,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:49:36,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:49:36,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:49:36,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:49:36,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:49:36,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:49:36,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:49:36,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:49:36,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:49:36,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:49:36,210 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:49:36,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:49:36,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:49:36,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:49:36,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:49:36,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:36,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:36,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:49:36,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:49:36,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:49:36,213 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 -> 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a [2025-01-09 15:49:36,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:49:36,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:49:36,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:49:36,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:49:36,443 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:49:36,444 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-66.i [2025-01-09 15:49:37,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e09d7314/e4ea6ea3066649669351fd773bbe8de5/FLAG8482febb9 [2025-01-09 15:49:37,856 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:49:37,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2025-01-09 15:49:37,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e09d7314/e4ea6ea3066649669351fd773bbe8de5/FLAG8482febb9 [2025-01-09 15:49:38,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e09d7314/e4ea6ea3066649669351fd773bbe8de5 [2025-01-09 15:49:38,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:49:38,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:49:38,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:38,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:49:38,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:49:38,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a486dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38, skipping insertion in model container [2025-01-09 15:49:38,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:49:38,282 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-66.i[916,929] [2025-01-09 15:49:38,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:38,331 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:49:38,340 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-66.i[916,929] [2025-01-09 15:49:38,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:38,379 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:49:38,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38 WrapperNode [2025-01-09 15:49:38,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:38,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:38,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:49:38,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:49:38,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,428 INFO L138 Inliner]: procedures = 26, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-01-09 15:49:38,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:38,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:49:38,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:49:38,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:49:38,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,468 INFO L175 MemorySlicer]: Split 123 memory accesses to 13 slices as follows [2, 7, 10, 8, 14, 8, 16, 8, 8, 14, 8, 13, 7]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1]. [2025-01-09 15:49:38,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:49:38,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:49:38,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:49:38,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:49:38,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (1/1) ... [2025-01-09 15:49:38,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:38,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:49:38,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:49:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:49:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:49:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:49:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:49:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:49:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:49:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:49:38,687 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:49:38,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:49:39,096 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:49:39,096 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:49:39,102 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:49:39,104 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:49:39,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:39 BoogieIcfgContainer [2025-01-09 15:49:39,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:49:39,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:49:39,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:49:39,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:49:39,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:38" (1/3) ... [2025-01-09 15:49:39,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a14cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:39, skipping insertion in model container [2025-01-09 15:49:39,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38" (2/3) ... [2025-01-09 15:49:39,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a14cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:39, skipping insertion in model container [2025-01-09 15:49:39,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:39" (3/3) ... [2025-01-09 15:49:39,111 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-66.i [2025-01-09 15:49:39,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:49:39,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:49:39,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:49:39,172 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;@4d825b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:49:39,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:49:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:49:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:49:39,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:39,183 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:39,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1738331553, now seen corresponding path program 1 times [2025-01-09 15:49:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111113679] [2025-01-09 15:49:39,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:49:39,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:49:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:49:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111113679] [2025-01-09 15:49:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111113679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021155637] [2025-01-09 15:49:39,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:39,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:39,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:49:39,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:49:39,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:49:39,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:39,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:39,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:49:39,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:49:39,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021155637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:39,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:49:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698230472] [2025-01-09 15:49:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:39,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:49:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:49:39,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:49:39,674 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:49:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:39,696 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-01-09 15:49:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:49:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-01-09 15:49:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:39,703 INFO L225 Difference]: With dead ends: 164 [2025-01-09 15:49:39,704 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 15:49:39,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:49:39,709 INFO L435 NwaCegarLoop]: 118 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, 118 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-01-09 15:49:39,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 15:49:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 15:49:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:49:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-01-09 15:49:39,742 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-01-09 15:49:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:39,742 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-01-09 15:49:39,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:49:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-01-09 15:49:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:49:39,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:39,744 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:39,751 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-01-09 15:49:39,944 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-01-09 15:49:39,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1756194437, now seen corresponding path program 1 times [2025-01-09 15:49:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636286421] [2025-01-09 15:49:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:49:40,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:49:40,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636286421] [2025-01-09 15:49:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636286421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146170400] [2025-01-09 15:49:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:40,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:40,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:40,281 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:40,317 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-01-09 15:49:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:49:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:40,321 INFO L225 Difference]: With dead ends: 164 [2025-01-09 15:49:40,321 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 15:49:40,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:40,322 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 15:49:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-01-09 15:49:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:49:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-01-09 15:49:40,332 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-01-09 15:49:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:40,333 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-01-09 15:49:40,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-01-09 15:49:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:49:40,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:40,334 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:40,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:49:40,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1758041479, now seen corresponding path program 1 times [2025-01-09 15:49:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:40,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372882304] [2025-01-09 15:49:40,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:40,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:49:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:49:40,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372882304] [2025-01-09 15:49:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372882304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:40,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:40,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650015056] [2025-01-09 15:49:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:40,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:40,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:40,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:40,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:40,681 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:40,795 INFO L93 Difference]: Finished difference Result 246 states and 354 transitions. [2025-01-09 15:49:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:49:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:40,797 INFO L225 Difference]: With dead ends: 246 [2025-01-09 15:49:40,797 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 15:49:40,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:40,798 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 77 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:40,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 15:49:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-01-09 15:49:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 126 states have internal predecessors, (169), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:49:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2025-01-09 15:49:40,823 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 109 [2025-01-09 15:49:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2025-01-09 15:49:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2025-01-09 15:49:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:49:40,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:40,826 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:49:40,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:40,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -812000443, now seen corresponding path program 1 times [2025-01-09 15:49:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320557073] [2025-01-09 15:49:40,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:40,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:49:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:49:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320557073] [2025-01-09 15:49:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320557073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:49:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586016622] [2025-01-09 15:49:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:49:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:49:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:42,340 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:42,813 INFO L93 Difference]: Finished difference Result 403 states and 582 transitions. [2025-01-09 15:49:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 110 [2025-01-09 15:49:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:42,815 INFO L225 Difference]: With dead ends: 403 [2025-01-09 15:49:42,815 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 15:49:42,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:42,816 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 386 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:42,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 486 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 15:49:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 173. [2025-01-09 15:49:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:49:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2025-01-09 15:49:42,841 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 110 [2025-01-09 15:49:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2025-01-09 15:49:42,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2025-01-09 15:49:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:49:42,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:42,845 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:42,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:49:42,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:42,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1398806457, now seen corresponding path program 1 times [2025-01-09 15:49:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:42,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270756042] [2025-01-09 15:49:42,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:42,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:42,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:49:42,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:49:42,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:42,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270756042] [2025-01-09 15:49:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270756042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188692338] [2025-01-09 15:49:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:43,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:43,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:43,322 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:43,733 INFO L93 Difference]: Finished difference Result 391 states and 551 transitions. [2025-01-09 15:49:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-01-09 15:49:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:43,736 INFO L225 Difference]: With dead ends: 391 [2025-01-09 15:49:43,736 INFO L226 Difference]: Without dead ends: 302 [2025-01-09 15:49:43,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:49:43,737 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 358 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:43,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 469 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-09 15:49:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 228. [2025-01-09 15:49:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.3166666666666667) internal successors, (237), 181 states have internal predecessors, (237), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:49:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 321 transitions. [2025-01-09 15:49:43,769 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 321 transitions. Word has length 110 [2025-01-09 15:49:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:43,769 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 321 transitions. [2025-01-09 15:49:43,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 321 transitions. [2025-01-09 15:49:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:49:43,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:43,775 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:43,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:49:43,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1894618951, now seen corresponding path program 1 times [2025-01-09 15:49:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858960350] [2025-01-09 15:49:43,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:49:43,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:49:43,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858960350] [2025-01-09 15:49:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858960350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:44,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:44,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863181547] [2025-01-09 15:49:44,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:44,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:44,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:44,240 INFO L87 Difference]: Start difference. First operand 228 states and 321 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:44,840 INFO L93 Difference]: Finished difference Result 558 states and 782 transitions. [2025-01-09 15:49:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-01-09 15:49:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:44,844 INFO L225 Difference]: With dead ends: 558 [2025-01-09 15:49:44,844 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 15:49:44,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:49:44,845 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 392 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:44,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 743 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:49:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 15:49:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 222. [2025-01-09 15:49:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 174 states have (on average 1.293103448275862) internal successors, (225), 175 states have internal predecessors, (225), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:49:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 309 transitions. [2025-01-09 15:49:44,874 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 309 transitions. Word has length 110 [2025-01-09 15:49:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:44,875 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 309 transitions. [2025-01-09 15:49:44,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 309 transitions. [2025-01-09 15:49:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:49:44,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:44,876 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:49:44,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2101490705, now seen corresponding path program 1 times [2025-01-09 15:49:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244026760] [2025-01-09 15:49:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:44,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:49:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:49:44,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244026760] [2025-01-09 15:49:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244026760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135852594] [2025-01-09 15:49:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:45,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:45,053 INFO L87 Difference]: Start difference. First operand 222 states and 309 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,136 INFO L93 Difference]: Finished difference Result 477 states and 660 transitions. [2025-01-09 15:49:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-01-09 15:49:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,138 INFO L225 Difference]: With dead ends: 477 [2025-01-09 15:49:45,139 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 15:49:45,139 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-01-09 15:49:45,140 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 483 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 15:49:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2025-01-09 15:49:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.296137339055794) internal successors, (302), 235 states have internal predecessors, (302), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 394 transitions. [2025-01-09 15:49:45,167 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 394 transitions. Word has length 111 [2025-01-09 15:49:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 394 transitions. [2025-01-09 15:49:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 394 transitions. [2025-01-09 15:49:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:49:45,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,169 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:45,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:49:45,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1080422351, now seen corresponding path program 1 times [2025-01-09 15:49:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041939037] [2025-01-09 15:49:45,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:45,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:49:45,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:49:45,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:45,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041939037] [2025-01-09 15:49:45,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041939037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:45,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:45,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288765774] [2025-01-09 15:49:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:45,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:45,305 INFO L87 Difference]: Start difference. First operand 288 states and 394 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,371 INFO L93 Difference]: Finished difference Result 542 states and 744 transitions. [2025-01-09 15:49:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-01-09 15:49:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,373 INFO L225 Difference]: With dead ends: 542 [2025-01-09 15:49:45,373 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 15:49:45,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:45,375 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 71 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 391 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 15:49:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2025-01-09 15:49:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 225 states have (on average 1.288888888888889) internal successors, (290), 227 states have internal predecessors, (290), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2025-01-09 15:49:45,401 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 111 [2025-01-09 15:49:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,401 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2025-01-09 15:49:45,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2025-01-09 15:49:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:45,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,402 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:49:45,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:45,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1752980, now seen corresponding path program 1 times [2025-01-09 15:49:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483640535] [2025-01-09 15:49:45,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:45,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:45,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:45,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483640535] [2025-01-09 15:49:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483640535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394248663] [2025-01-09 15:49:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:49:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:49:45,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:45,463 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,493 INFO L93 Difference]: Finished difference Result 523 states and 718 transitions. [2025-01-09 15:49:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:49:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-01-09 15:49:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,495 INFO L225 Difference]: With dead ends: 523 [2025-01-09 15:49:45,495 INFO L226 Difference]: Without dead ends: 283 [2025-01-09 15:49:45,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:45,496 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-09 15:49:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-01-09 15:49:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.2850877192982457) internal successors, (293), 230 states have internal predecessors, (293), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 385 transitions. [2025-01-09 15:49:45,522 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 385 transitions. Word has length 113 [2025-01-09 15:49:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,523 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 385 transitions. [2025-01-09 15:49:45,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 385 transitions. [2025-01-09 15:49:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,524 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:49:45,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:45,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -588558994, now seen corresponding path program 1 times [2025-01-09 15:49:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:45,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218858458] [2025-01-09 15:49:45,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:45,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:49:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218858458] [2025-01-09 15:49:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218858458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481210976] [2025-01-09 15:49:45,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:45,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:45,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:45,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:49:45,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:45,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:49:45,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:45,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481210976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:49:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470334382] [2025-01-09 15:49:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:45,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:45,819 INFO L87 Difference]: Start difference. First operand 283 states and 385 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,868 INFO L93 Difference]: Finished difference Result 535 states and 730 transitions. [2025-01-09 15:49:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-01-09 15:49:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,871 INFO L225 Difference]: With dead ends: 535 [2025-01-09 15:49:45,871 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 15:49:45,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:45,873 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 15:49:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-01-09 15:49:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 237 states have (on average 1.2742616033755274) internal successors, (302), 239 states have internal predecessors, (302), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 394 transitions. [2025-01-09 15:49:45,907 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 394 transitions. Word has length 113 [2025-01-09 15:49:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 394 transitions. [2025-01-09 15:49:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 394 transitions. [2025-01-09 15:49:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,908 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:45,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:49:46,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:46,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -197020325, now seen corresponding path program 1 times [2025-01-09 15:49:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462374427] [2025-01-09 15:49:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:46,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:46,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462374427] [2025-01-09 15:49:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462374427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:49:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295354370] [2025-01-09 15:49:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:47,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:49:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:49:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:47,226 INFO L87 Difference]: Start difference. First operand 292 states and 394 transitions. Second operand has 19 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-09 15:49:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:49,229 INFO L93 Difference]: Finished difference Result 727 states and 979 transitions. [2025-01-09 15:49:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 15:49:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 113 [2025-01-09 15:49:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:49,232 INFO L225 Difference]: With dead ends: 727 [2025-01-09 15:49:49,232 INFO L226 Difference]: Without dead ends: 560 [2025-01-09 15:49:49,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=375, Invalid=1347, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:49:49,233 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1149 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:49,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1064 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:49:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-09 15:49:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 354. [2025-01-09 15:49:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 295 states have (on average 1.2915254237288136) internal successors, (381), 298 states have internal predecessors, (381), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:49:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 477 transitions. [2025-01-09 15:49:49,263 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 477 transitions. Word has length 113 [2025-01-09 15:49:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:49,263 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 477 transitions. [2025-01-09 15:49:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-09 15:49:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 477 transitions. [2025-01-09 15:49:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:49,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:49,264 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:49,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:49:49,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1785368227, now seen corresponding path program 1 times [2025-01-09 15:49:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659124907] [2025-01-09 15:49:49,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:49,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:49,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:49,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:49,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659124907] [2025-01-09 15:49:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659124907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:49:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473269728] [2025-01-09 15:49:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:49,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:49:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:49,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:49:49,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:49,951 INFO L87 Difference]: Start difference. First operand 354 states and 477 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:50,228 INFO L93 Difference]: Finished difference Result 651 states and 887 transitions. [2025-01-09 15:49:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:50,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 113 [2025-01-09 15:49:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:50,231 INFO L225 Difference]: With dead ends: 651 [2025-01-09 15:49:50,231 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 15:49:50,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:49:50,233 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 331 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:50,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 729 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 15:49:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 354. [2025-01-09 15:49:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 295 states have (on average 1.2915254237288136) internal successors, (381), 298 states have internal predecessors, (381), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:49:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 477 transitions. [2025-01-09 15:49:50,265 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 477 transitions. Word has length 113 [2025-01-09 15:49:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:50,267 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 477 transitions. [2025-01-09 15:49:50,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 477 transitions. [2025-01-09 15:49:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:50,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:50,268 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:50,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:49:50,270 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:50,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash 225681501, now seen corresponding path program 1 times [2025-01-09 15:49:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:50,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288151603] [2025-01-09 15:49:50,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:50,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:50,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:50,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:50,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288151603] [2025-01-09 15:49:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288151603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:49:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770367960] [2025-01-09 15:49:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:49:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:51,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:49:51,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:49:51,172 INFO L87 Difference]: Start difference. First operand 354 states and 477 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:53,261 INFO L93 Difference]: Finished difference Result 929 states and 1262 transitions. [2025-01-09 15:49:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:49:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 113 [2025-01-09 15:49:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:53,265 INFO L225 Difference]: With dead ends: 929 [2025-01-09 15:49:53,265 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 15:49:53,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 15:49:53,266 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 727 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2749 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:49:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 15:49:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 364. [2025-01-09 15:49:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 305 states have (on average 1.301639344262295) internal successors, (397), 308 states have internal predecessors, (397), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:49:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 493 transitions. [2025-01-09 15:49:53,311 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 493 transitions. Word has length 113 [2025-01-09 15:49:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:53,312 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 493 transitions. [2025-01-09 15:49:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 493 transitions. [2025-01-09 15:49:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:49:53,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:53,314 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:53,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:49:53,314 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:53,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1402043375, now seen corresponding path program 1 times [2025-01-09 15:49:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482351311] [2025-01-09 15:49:53,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:49:53,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:49:53,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:53,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482351311] [2025-01-09 15:49:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482351311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:53,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206814238] [2025-01-09 15:49:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:53,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:53,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:53,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:53,616 INFO L87 Difference]: Start difference. First operand 364 states and 493 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:53,884 INFO L93 Difference]: Finished difference Result 698 states and 945 transitions. [2025-01-09 15:49:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:49:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 115 [2025-01-09 15:49:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:53,886 INFO L225 Difference]: With dead ends: 698 [2025-01-09 15:49:53,886 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 15:49:53,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:53,887 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 339 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:53,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 608 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 15:49:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 356. [2025-01-09 15:49:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 308 states have (on average 1.3181818181818181) internal successors, (406), 311 states have internal predecessors, (406), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 482 transitions. [2025-01-09 15:49:53,922 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 482 transitions. Word has length 115 [2025-01-09 15:49:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:53,922 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 482 transitions. [2025-01-09 15:49:53,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 482 transitions. [2025-01-09 15:49:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:49:53,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:53,924 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:49:53,924 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash -308822871, now seen corresponding path program 1 times [2025-01-09 15:49:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422338758] [2025-01-09 15:49:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:53,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:49:53,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:49:53,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:53,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422338758] [2025-01-09 15:49:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422338758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451315438] [2025-01-09 15:49:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:54,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:54,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:54,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:54,292 INFO L87 Difference]: Start difference. First operand 356 states and 482 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:54,681 INFO L93 Difference]: Finished difference Result 807 states and 1098 transitions. [2025-01-09 15:49:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-01-09 15:49:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:54,683 INFO L225 Difference]: With dead ends: 807 [2025-01-09 15:49:54,683 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 15:49:54,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:54,684 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 332 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:54,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 853 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 15:49:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 372. [2025-01-09 15:49:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 324 states have (on average 1.3117283950617284) internal successors, (425), 327 states have internal predecessors, (425), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 501 transitions. [2025-01-09 15:49:54,723 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 501 transitions. Word has length 115 [2025-01-09 15:49:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:54,723 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 501 transitions. [2025-01-09 15:49:54,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 501 transitions. [2025-01-09 15:49:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:49:54,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:54,724 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:49:54,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1467669091, now seen corresponding path program 1 times [2025-01-09 15:49:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642399573] [2025-01-09 15:49:54,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:54,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:49:54,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:49:54,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:54,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642399573] [2025-01-09 15:49:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642399573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:49:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315565249] [2025-01-09 15:49:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:49:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:55,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:49:55,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:55,375 INFO L87 Difference]: Start difference. First operand 372 states and 501 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:56,532 INFO L93 Difference]: Finished difference Result 949 states and 1277 transitions. [2025-01-09 15:49:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:49:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 115 [2025-01-09 15:49:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:56,535 INFO L225 Difference]: With dead ends: 949 [2025-01-09 15:49:56,535 INFO L226 Difference]: Without dead ends: 708 [2025-01-09 15:49:56,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=932, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 15:49:56,537 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 916 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:56,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 844 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:49:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-01-09 15:49:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 355. [2025-01-09 15:49:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.293159609120521) internal successors, (397), 310 states have internal predecessors, (397), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 473 transitions. [2025-01-09 15:49:56,578 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 473 transitions. Word has length 115 [2025-01-09 15:49:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:56,579 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 473 transitions. [2025-01-09 15:49:56,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:49:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 473 transitions. [2025-01-09 15:49:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:49:56,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:56,580 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:56,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:49:56,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:56,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:56,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1583870345, now seen corresponding path program 1 times [2025-01-09 15:49:56,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:56,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161254225] [2025-01-09 15:49:56,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:56,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:56,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:49:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:49:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161254225] [2025-01-09 15:49:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161254225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:56,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:49:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960248653] [2025-01-09 15:49:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:56,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:56,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:56,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:56,831 INFO L87 Difference]: Start difference. First operand 355 states and 473 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:57,000 INFO L93 Difference]: Finished difference Result 690 states and 923 transitions. [2025-01-09 15:49:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:57,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-01-09 15:49:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:57,002 INFO L225 Difference]: With dead ends: 690 [2025-01-09 15:49:57,002 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 15:49:57,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:57,003 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 269 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:57,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 498 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 15:49:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2025-01-09 15:49:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 305 states have (on average 1.2885245901639344) internal successors, (393), 308 states have internal predecessors, (393), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 469 transitions. [2025-01-09 15:49:57,040 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 469 transitions. Word has length 116 [2025-01-09 15:49:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 469 transitions. [2025-01-09 15:49:57,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2025-01-09 15:49:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:49:57,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:57,041 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:49:57,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1617876447, now seen corresponding path program 1 times [2025-01-09 15:49:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769867084] [2025-01-09 15:49:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:57,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:49:57,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:49:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769867084] [2025-01-09 15:49:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769867084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:57,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77387472] [2025-01-09 15:49:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:57,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:57,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:57,160 INFO L87 Difference]: Start difference. First operand 353 states and 469 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:57,236 INFO L93 Difference]: Finished difference Result 697 states and 931 transitions. [2025-01-09 15:49:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:57,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-01-09 15:49:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:57,238 INFO L225 Difference]: With dead ends: 697 [2025-01-09 15:49:57,238 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 15:49:57,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:57,239 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:57,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 438 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 15:49:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 353. [2025-01-09 15:49:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 305 states have (on average 1.2852459016393443) internal successors, (392), 308 states have internal predecessors, (392), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 468 transitions. [2025-01-09 15:49:57,273 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 468 transitions. Word has length 116 [2025-01-09 15:49:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 468 transitions. [2025-01-09 15:49:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:49:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 468 transitions. [2025-01-09 15:49:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:49:57,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:57,275 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:57,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:49:57,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:57,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 304006667, now seen corresponding path program 1 times [2025-01-09 15:49:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191961336] [2025-01-09 15:49:57,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:49:57,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:49:57,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:57,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191961336] [2025-01-09 15:49:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191961336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:57,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:57,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:49:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737276862] [2025-01-09 15:49:57,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:57,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:57,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:57,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:57,474 INFO L87 Difference]: Start difference. First operand 353 states and 468 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:57,655 INFO L93 Difference]: Finished difference Result 669 states and 886 transitions. [2025-01-09 15:49:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:57,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2025-01-09 15:49:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:57,657 INFO L225 Difference]: With dead ends: 669 [2025-01-09 15:49:57,657 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 15:49:57,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:57,658 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 165 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:57,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 499 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 15:49:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 333. [2025-01-09 15:49:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 285 states have (on average 1.263157894736842) internal successors, (360), 288 states have internal predecessors, (360), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 436 transitions. [2025-01-09 15:49:57,714 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 436 transitions. Word has length 116 [2025-01-09 15:49:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:57,714 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 436 transitions. [2025-01-09 15:49:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 436 transitions. [2025-01-09 15:49:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:49:57,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:57,716 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:57,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:49:57,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -383265140, now seen corresponding path program 1 times [2025-01-09 15:49:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022181929] [2025-01-09 15:49:57,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:49:57,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:49:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022181929] [2025-01-09 15:49:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022181929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474788213] [2025-01-09 15:49:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:58,153 INFO L87 Difference]: Start difference. First operand 333 states and 436 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:58,379 INFO L93 Difference]: Finished difference Result 630 states and 832 transitions. [2025-01-09 15:49:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:49:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-01-09 15:49:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:58,381 INFO L225 Difference]: With dead ends: 630 [2025-01-09 15:49:58,381 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 15:49:58,381 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-01-09 15:49:58,382 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 183 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:58,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 678 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 15:49:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 374. [2025-01-09 15:49:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 326 states have (on average 1.2576687116564418) internal successors, (410), 329 states have internal predecessors, (410), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 486 transitions. [2025-01-09 15:49:58,419 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 486 transitions. Word has length 117 [2025-01-09 15:49:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:58,419 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 486 transitions. [2025-01-09 15:49:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 486 transitions. [2025-01-09 15:49:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:49:58,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:58,420 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:58,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:49:58,421 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2134847752, now seen corresponding path program 1 times [2025-01-09 15:49:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435600786] [2025-01-09 15:49:58,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:49:58,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:49:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435600786] [2025-01-09 15:49:58,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435600786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:58,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190555136] [2025-01-09 15:49:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:58,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:58,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:58,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:58,744 INFO L87 Difference]: Start difference. First operand 374 states and 486 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:58,948 INFO L93 Difference]: Finished difference Result 397 states and 513 transitions. [2025-01-09 15:49:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2025-01-09 15:49:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:58,950 INFO L225 Difference]: With dead ends: 397 [2025-01-09 15:49:58,951 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 15:49:58,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:58,951 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 160 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:58,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 557 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 15:49:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 386. [2025-01-09 15:49:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 338 states have (on average 1.2485207100591715) internal successors, (422), 341 states have internal predecessors, (422), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 498 transitions. [2025-01-09 15:49:58,989 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 498 transitions. Word has length 117 [2025-01-09 15:49:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:58,989 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 498 transitions. [2025-01-09 15:49:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:49:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 498 transitions. [2025-01-09 15:49:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:49:58,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:58,991 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:58,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:49:58,991 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2136694794, now seen corresponding path program 1 times [2025-01-09 15:49:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985281035] [2025-01-09 15:49:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:49:59,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:49:59,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:59,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:49:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985281035] [2025-01-09 15:49:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985281035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:59,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:59,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665536935] [2025-01-09 15:49:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:59,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:59,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:59,317 INFO L87 Difference]: Start difference. First operand 386 states and 498 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:59,556 INFO L93 Difference]: Finished difference Result 781 states and 1008 transitions. [2025-01-09 15:49:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-01-09 15:49:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:59,558 INFO L225 Difference]: With dead ends: 781 [2025-01-09 15:49:59,559 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 15:49:59,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:59,561 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:59,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 595 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 15:49:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 414. [2025-01-09 15:49:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 355 states have (on average 1.2253521126760563) internal successors, (435), 358 states have internal predecessors, (435), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 527 transitions. [2025-01-09 15:49:59,604 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 527 transitions. Word has length 117 [2025-01-09 15:49:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 527 transitions. [2025-01-09 15:49:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:49:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 527 transitions. [2025-01-09 15:49:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:49:59,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:59,605 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:59,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:49:59,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:59,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:59,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1212832883, now seen corresponding path program 1 times [2025-01-09 15:49:59,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:59,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077825939] [2025-01-09 15:49:59,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:59,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:49:59,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:49:59,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:59,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:00,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077825939] [2025-01-09 15:50:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077825939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:00,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:50:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784488] [2025-01-09 15:50:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:00,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:50:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:00,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:50:00,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:00,093 INFO L87 Difference]: Start difference. First operand 414 states and 527 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:00,734 INFO L93 Difference]: Finished difference Result 958 states and 1239 transitions. [2025-01-09 15:50:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:50:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-01-09 15:50:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:00,737 INFO L225 Difference]: With dead ends: 958 [2025-01-09 15:50:00,737 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 15:50:00,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:50:00,738 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 570 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:00,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1087 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 15:50:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 451. [2025-01-09 15:50:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 401 states have (on average 1.259351620947631) internal successors, (505), 404 states have internal predecessors, (505), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:50:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 581 transitions. [2025-01-09 15:50:00,777 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 581 transitions. Word has length 118 [2025-01-09 15:50:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:00,778 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 581 transitions. [2025-01-09 15:50:00,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 581 transitions. [2025-01-09 15:50:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:50:00,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:00,779 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:00,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:50:00,779 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -67030795, now seen corresponding path program 1 times [2025-01-09 15:50:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833325348] [2025-01-09 15:50:00,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:50:00,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:50:00,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:00,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833325348] [2025-01-09 15:50:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833325348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491069680] [2025-01-09 15:50:01,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:01,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:01,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:01,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:01,082 INFO L87 Difference]: Start difference. First operand 451 states and 581 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:01,472 INFO L93 Difference]: Finished difference Result 902 states and 1159 transitions. [2025-01-09 15:50:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-01-09 15:50:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:01,474 INFO L225 Difference]: With dead ends: 902 [2025-01-09 15:50:01,474 INFO L226 Difference]: Without dead ends: 624 [2025-01-09 15:50:01,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:50:01,475 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 422 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:01,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 771 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-01-09 15:50:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 451. [2025-01-09 15:50:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 401 states have (on average 1.254364089775561) internal successors, (503), 404 states have internal predecessors, (503), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:50:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 579 transitions. [2025-01-09 15:50:01,515 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 579 transitions. Word has length 118 [2025-01-09 15:50:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:01,515 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 579 transitions. [2025-01-09 15:50:01,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 579 transitions. [2025-01-09 15:50:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:50:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:01,516 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:50:01,517 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -184171651, now seen corresponding path program 1 times [2025-01-09 15:50:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861170259] [2025-01-09 15:50:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:01,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:50:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:50:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861170259] [2025-01-09 15:50:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861170259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:01,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:50:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214627391] [2025-01-09 15:50:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:01,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:50:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:01,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:50:01,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:01,665 INFO L87 Difference]: Start difference. First operand 451 states and 579 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:01,894 INFO L93 Difference]: Finished difference Result 866 states and 1114 transitions. [2025-01-09 15:50:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-01-09 15:50:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:01,896 INFO L225 Difference]: With dead ends: 866 [2025-01-09 15:50:01,896 INFO L226 Difference]: Without dead ends: 581 [2025-01-09 15:50:01,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:01,897 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 181 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:01,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 675 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-09 15:50:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 442. [2025-01-09 15:50:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 392 states have (on average 1.2448979591836735) internal successors, (488), 395 states have internal predecessors, (488), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:50:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 564 transitions. [2025-01-09 15:50:01,942 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 564 transitions. Word has length 118 [2025-01-09 15:50:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:01,942 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 564 transitions. [2025-01-09 15:50:01,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 564 transitions. [2025-01-09 15:50:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:50:01,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:01,944 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:50:01,944 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1464035329, now seen corresponding path program 1 times [2025-01-09 15:50:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701787357] [2025-01-09 15:50:01,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:01,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:50:02,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:50:02,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:02,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701787357] [2025-01-09 15:50:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701787357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:02,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:02,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:50:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788059898] [2025-01-09 15:50:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:50:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:02,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:50:02,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:02,373 INFO L87 Difference]: Start difference. First operand 442 states and 564 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:02,978 INFO L93 Difference]: Finished difference Result 907 states and 1159 transitions. [2025-01-09 15:50:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:50:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-01-09 15:50:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:02,981 INFO L225 Difference]: With dead ends: 907 [2025-01-09 15:50:02,981 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 15:50:02,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:50:02,982 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 695 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:02,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 808 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 15:50:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 448. [2025-01-09 15:50:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 401 states have internal predecessors, (497), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:50:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 573 transitions. [2025-01-09 15:50:03,035 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 573 transitions. Word has length 118 [2025-01-09 15:50:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 573 transitions. [2025-01-09 15:50:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 573 transitions. [2025-01-09 15:50:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:03,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:03,036 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:03,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:50:03,036 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:03,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -884481148, now seen corresponding path program 1 times [2025-01-09 15:50:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849600114] [2025-01-09 15:50:03,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:50:03,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:50:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849600114] [2025-01-09 15:50:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849600114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:50:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157384641] [2025-01-09 15:50:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:50:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:03,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:50:03,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:03,423 INFO L87 Difference]: Start difference. First operand 448 states and 573 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:03,748 INFO L93 Difference]: Finished difference Result 784 states and 1001 transitions. [2025-01-09 15:50:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 119 [2025-01-09 15:50:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:03,751 INFO L225 Difference]: With dead ends: 784 [2025-01-09 15:50:03,751 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 15:50:03,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:03,751 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 269 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:03,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 498 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 15:50:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 413. [2025-01-09 15:50:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 365 states have (on average 1.2191780821917808) internal successors, (445), 368 states have internal predecessors, (445), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:50:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 517 transitions. [2025-01-09 15:50:03,808 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 517 transitions. Word has length 119 [2025-01-09 15:50:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:03,808 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 517 transitions. [2025-01-09 15:50:03,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 517 transitions. [2025-01-09 15:50:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:03,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:03,809 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:50:03,809 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 87800124, now seen corresponding path program 1 times [2025-01-09 15:50:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081768151] [2025-01-09 15:50:03,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:03,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:50:03,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:50:03,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:03,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:03,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081768151] [2025-01-09 15:50:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081768151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431585489] [2025-01-09 15:50:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:03,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:03,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:03,976 INFO L87 Difference]: Start difference. First operand 413 states and 517 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:04,162 INFO L93 Difference]: Finished difference Result 826 states and 1033 transitions. [2025-01-09 15:50:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:04,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-01-09 15:50:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:04,165 INFO L225 Difference]: With dead ends: 826 [2025-01-09 15:50:04,165 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 15:50:04,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:04,165 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 195 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:04,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 410 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 15:50:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 413. [2025-01-09 15:50:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 365 states have (on average 1.210958904109589) internal successors, (442), 368 states have internal predecessors, (442), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:50:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 514 transitions. [2025-01-09 15:50:04,222 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 514 transitions. Word has length 119 [2025-01-09 15:50:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:04,223 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 514 transitions. [2025-01-09 15:50:04,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 514 transitions. [2025-01-09 15:50:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:04,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:04,224 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:04,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:50:04,224 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 345965562, now seen corresponding path program 1 times [2025-01-09 15:50:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807181069] [2025-01-09 15:50:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:04,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:50:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:50:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807181069] [2025-01-09 15:50:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807181069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903038885] [2025-01-09 15:50:04,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:04,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:04,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:04,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:04,539 INFO L87 Difference]: Start difference. First operand 413 states and 514 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:04,864 INFO L93 Difference]: Finished difference Result 922 states and 1141 transitions. [2025-01-09 15:50:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:50:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:04,866 INFO L225 Difference]: With dead ends: 922 [2025-01-09 15:50:04,866 INFO L226 Difference]: Without dead ends: 512 [2025-01-09 15:50:04,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:04,867 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 178 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:04,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1091 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-01-09 15:50:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 429. [2025-01-09 15:50:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 381 states have (on average 1.204724409448819) internal successors, (459), 384 states have internal predecessors, (459), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:50:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 531 transitions. [2025-01-09 15:50:04,917 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 531 transitions. Word has length 119 [2025-01-09 15:50:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:04,918 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 531 transitions. [2025-01-09 15:50:04,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 531 transitions. [2025-01-09 15:50:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:04,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:04,919 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:04,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:50:04,919 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1047030140, now seen corresponding path program 1 times [2025-01-09 15:50:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:04,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398949845] [2025-01-09 15:50:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:04,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:50:04,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:50:04,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:04,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398949845] [2025-01-09 15:50:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398949845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:05,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:05,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:50:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197426202] [2025-01-09 15:50:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:05,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:50:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:05,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:50:05,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:05,064 INFO L87 Difference]: Start difference. First operand 429 states and 531 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:05,249 INFO L93 Difference]: Finished difference Result 968 states and 1197 transitions. [2025-01-09 15:50:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:50:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:05,252 INFO L225 Difference]: With dead ends: 968 [2025-01-09 15:50:05,252 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 15:50:05,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:05,253 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 68 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:05,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 512 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 15:50:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2025-01-09 15:50:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 452 states have (on average 1.2101769911504425) internal successors, (547), 455 states have internal predecessors, (547), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:50:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 619 transitions. [2025-01-09 15:50:05,297 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 619 transitions. Word has length 119 [2025-01-09 15:50:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:05,297 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 619 transitions. [2025-01-09 15:50:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 619 transitions. [2025-01-09 15:50:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:05,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:05,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:05,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:50:05,299 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1459472772, now seen corresponding path program 1 times [2025-01-09 15:50:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724845831] [2025-01-09 15:50:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:05,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:50:05,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:50:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724845831] [2025-01-09 15:50:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724845831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:05,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293460984] [2025-01-09 15:50:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:05,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:05,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:05,741 INFO L87 Difference]: Start difference. First operand 500 states and 619 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:06,102 INFO L93 Difference]: Finished difference Result 1237 states and 1527 transitions. [2025-01-09 15:50:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-01-09 15:50:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:06,106 INFO L225 Difference]: With dead ends: 1237 [2025-01-09 15:50:06,106 INFO L226 Difference]: Without dead ends: 740 [2025-01-09 15:50:06,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:06,108 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 331 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:06,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 546 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-01-09 15:50:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 583. [2025-01-09 15:50:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 516 states have (on average 1.2073643410852712) internal successors, (623), 519 states have internal predecessors, (623), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:50:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 723 transitions. [2025-01-09 15:50:06,187 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 723 transitions. Word has length 119 [2025-01-09 15:50:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 723 transitions. [2025-01-09 15:50:06,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 723 transitions. [2025-01-09 15:50:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:50:06,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:06,188 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:50:06,188 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:06,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1706675983, now seen corresponding path program 1 times [2025-01-09 15:50:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003139742] [2025-01-09 15:50:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:06,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:50:06,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:50:06,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:06,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003139742] [2025-01-09 15:50:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003139742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:07,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:07,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:50:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354533544] [2025-01-09 15:50:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:50:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:07,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:50:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:50:07,143 INFO L87 Difference]: Start difference. First operand 583 states and 723 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:10,599 INFO L93 Difference]: Finished difference Result 1004 states and 1249 transitions. [2025-01-09 15:50:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:50:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 120 [2025-01-09 15:50:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:10,602 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 15:50:10,602 INFO L226 Difference]: Without dead ends: 681 [2025-01-09 15:50:10,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:50:10,604 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 607 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:10,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 921 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 15:50:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-01-09 15:50:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 599. [2025-01-09 15:50:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 532 states have (on average 1.2086466165413534) internal successors, (643), 535 states have internal predecessors, (643), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:50:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 743 transitions. [2025-01-09 15:50:10,680 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 743 transitions. Word has length 120 [2025-01-09 15:50:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:10,680 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 743 transitions. [2025-01-09 15:50:10,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 743 transitions. [2025-01-09 15:50:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:50:10,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:10,681 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:10,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:50:10,681 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1827615432, now seen corresponding path program 1 times [2025-01-09 15:50:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560645260] [2025-01-09 15:50:10,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:10,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:50:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:50:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560645260] [2025-01-09 15:50:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560645260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377571015] [2025-01-09 15:50:11,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:11,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:11,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:11,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:11,013 INFO L87 Difference]: Start difference. First operand 599 states and 743 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:11,274 INFO L93 Difference]: Finished difference Result 994 states and 1241 transitions. [2025-01-09 15:50:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2025-01-09 15:50:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:11,277 INFO L225 Difference]: With dead ends: 994 [2025-01-09 15:50:11,277 INFO L226 Difference]: Without dead ends: 655 [2025-01-09 15:50:11,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:11,278 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 334 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:11,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 592 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-01-09 15:50:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 591. [2025-01-09 15:50:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 526 states have (on average 1.2129277566539924) internal successors, (638), 528 states have internal predecessors, (638), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:50:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 734 transitions. [2025-01-09 15:50:11,371 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 734 transitions. Word has length 121 [2025-01-09 15:50:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:11,371 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 734 transitions. [2025-01-09 15:50:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 734 transitions. [2025-01-09 15:50:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:50:11,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:11,372 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:11,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:50:11,372 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:11,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1246468549, now seen corresponding path program 1 times [2025-01-09 15:50:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354764861] [2025-01-09 15:50:11,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:11,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:50:11,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:50:11,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:11,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354764861] [2025-01-09 15:50:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354764861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-01-09 15:50:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053515658] [2025-01-09 15:50:13,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:13,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 15:50:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:13,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 15:50:13,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:50:13,539 INFO L87 Difference]: Start difference. First operand 591 states and 734 transitions. Second operand has 29 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-01-09 15:50:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:17,584 INFO L93 Difference]: Finished difference Result 1267 states and 1589 transitions. [2025-01-09 15:50:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 15:50:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 121 [2025-01-09 15:50:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:17,587 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 15:50:17,587 INFO L226 Difference]: Without dead ends: 936 [2025-01-09 15:50:17,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=507, Invalid=2463, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 15:50:17,589 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 547 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:17,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2104 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 15:50:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-01-09 15:50:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 721. [2025-01-09 15:50:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 645 states have (on average 1.22015503875969) internal successors, (787), 648 states have internal predecessors, (787), 56 states have call successors, (56), 19 states have call predecessors, (56), 19 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:50:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 899 transitions. [2025-01-09 15:50:17,675 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 899 transitions. Word has length 121 [2025-01-09 15:50:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:17,675 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 899 transitions. [2025-01-09 15:50:17,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-01-09 15:50:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 899 transitions. [2025-01-09 15:50:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:50:17,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:17,676 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:50:17,676 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1809718985, now seen corresponding path program 1 times [2025-01-09 15:50:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967607709] [2025-01-09 15:50:17,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:17,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:50:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:50:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:17,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:18,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967607709] [2025-01-09 15:50:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967607709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:50:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819830619] [2025-01-09 15:50:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:50:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:50:18,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:18,071 INFO L87 Difference]: Start difference. First operand 721 states and 899 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:18,409 INFO L93 Difference]: Finished difference Result 1385 states and 1741 transitions. [2025-01-09 15:50:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:50:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:50:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:18,412 INFO L225 Difference]: With dead ends: 1385 [2025-01-09 15:50:18,412 INFO L226 Difference]: Without dead ends: 954 [2025-01-09 15:50:18,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:18,413 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 83 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:18,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1491 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-01-09 15:50:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 857. [2025-01-09 15:50:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 778 states have (on average 1.2300771208226222) internal successors, (957), 782 states have internal predecessors, (957), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:50:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1073 transitions. [2025-01-09 15:50:18,526 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1073 transitions. Word has length 121 [2025-01-09 15:50:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:18,527 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1073 transitions. [2025-01-09 15:50:18,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1073 transitions. [2025-01-09 15:50:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:50:18,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:18,528 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:18,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:50:18,528 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 168517881, now seen corresponding path program 1 times [2025-01-09 15:50:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653578911] [2025-01-09 15:50:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:18,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:50:18,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:50:18,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653578911] [2025-01-09 15:50:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653578911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:50:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223483974] [2025-01-09 15:50:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:19,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:50:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:19,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:50:19,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:19,077 INFO L87 Difference]: Start difference. First operand 857 states and 1073 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:20,164 INFO L93 Difference]: Finished difference Result 1752 states and 2188 transitions. [2025-01-09 15:50:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:50:20,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 122 [2025-01-09 15:50:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:20,168 INFO L225 Difference]: With dead ends: 1752 [2025-01-09 15:50:20,168 INFO L226 Difference]: Without dead ends: 1227 [2025-01-09 15:50:20,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2025-01-09 15:50:20,170 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 657 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:20,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1846 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:50:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-01-09 15:50:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1037. [2025-01-09 15:50:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 943 states have (on average 1.2205726405090138) internal successors, (1151), 949 states have internal predecessors, (1151), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1287 transitions. [2025-01-09 15:50:20,295 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1287 transitions. Word has length 122 [2025-01-09 15:50:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:20,295 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1287 transitions. [2025-01-09 15:50:20,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1287 transitions. [2025-01-09 15:50:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:50:20,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:20,297 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:50:20,297 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1127747897, now seen corresponding path program 1 times [2025-01-09 15:50:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417473700] [2025-01-09 15:50:20,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:20,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:50:20,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:50:20,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417473700] [2025-01-09 15:50:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417473700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:20,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543241715] [2025-01-09 15:50:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:20,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:20,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:20,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:20,583 INFO L87 Difference]: Start difference. First operand 1037 states and 1287 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:20,970 INFO L93 Difference]: Finished difference Result 2057 states and 2540 transitions. [2025-01-09 15:50:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 122 [2025-01-09 15:50:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:20,974 INFO L225 Difference]: With dead ends: 2057 [2025-01-09 15:50:20,975 INFO L226 Difference]: Without dead ends: 1377 [2025-01-09 15:50:20,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:20,976 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 240 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:20,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 595 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-01-09 15:50:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1100. [2025-01-09 15:50:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1006 states have (on average 1.2246520874751492) internal successors, (1232), 1012 states have internal predecessors, (1232), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1368 transitions. [2025-01-09 15:50:21,099 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1368 transitions. Word has length 122 [2025-01-09 15:50:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1368 transitions. [2025-01-09 15:50:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1368 transitions. [2025-01-09 15:50:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:21,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:21,101 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:21,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:50:21,101 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:21,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 747530495, now seen corresponding path program 1 times [2025-01-09 15:50:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097463983] [2025-01-09 15:50:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097463983] [2025-01-09 15:50:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097463983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:21,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:50:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885487781] [2025-01-09 15:50:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:21,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:50:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:21,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:50:21,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:21,894 INFO L87 Difference]: Start difference. First operand 1100 states and 1368 transitions. Second operand has 18 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-09 15:50:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:23,144 INFO L93 Difference]: Finished difference Result 2090 states and 2618 transitions. [2025-01-09 15:50:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:50:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 123 [2025-01-09 15:50:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:23,149 INFO L225 Difference]: With dead ends: 2090 [2025-01-09 15:50:23,149 INFO L226 Difference]: Without dead ends: 1392 [2025-01-09 15:50:23,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:50:23,152 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 430 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:23,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1043 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:50:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-01-09 15:50:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1209. [2025-01-09 15:50:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1115 states have (on average 1.229596412556054) internal successors, (1371), 1121 states have internal predecessors, (1371), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1507 transitions. [2025-01-09 15:50:23,302 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1507 transitions. Word has length 123 [2025-01-09 15:50:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:23,302 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1507 transitions. [2025-01-09 15:50:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 17 states have internal predecessors, (56), 8 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-01-09 15:50:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1507 transitions. [2025-01-09 15:50:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:23,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:23,304 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:23,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:50:23,304 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:23,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -840817407, now seen corresponding path program 1 times [2025-01-09 15:50:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:23,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689951375] [2025-01-09 15:50:23,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:23,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:23,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:23,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:23,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689951375] [2025-01-09 15:50:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689951375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197383317] [2025-01-09 15:50:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:23,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:23,716 INFO L87 Difference]: Start difference. First operand 1209 states and 1507 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:24,240 INFO L93 Difference]: Finished difference Result 2112 states and 2643 transitions. [2025-01-09 15:50:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:50:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:24,244 INFO L225 Difference]: With dead ends: 2112 [2025-01-09 15:50:24,244 INFO L226 Difference]: Without dead ends: 1363 [2025-01-09 15:50:24,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:24,246 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 159 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:24,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 856 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-01-09 15:50:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1197. [2025-01-09 15:50:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1103 states have (on average 1.2275611967361741) internal successors, (1354), 1109 states have internal predecessors, (1354), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1490 transitions. [2025-01-09 15:50:24,399 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1490 transitions. Word has length 123 [2025-01-09 15:50:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:24,399 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1490 transitions. [2025-01-09 15:50:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1490 transitions. [2025-01-09 15:50:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:24,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:24,405 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:50:24,405 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -786730561, now seen corresponding path program 1 times [2025-01-09 15:50:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238268685] [2025-01-09 15:50:24,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:24,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:24,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:24,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:24,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238268685] [2025-01-09 15:50:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238268685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:25,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:25,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 15:50:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691212351] [2025-01-09 15:50:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:25,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 15:50:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:25,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 15:50:25,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:50:25,496 INFO L87 Difference]: Start difference. First operand 1197 states and 1490 transitions. Second operand has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-01-09 15:50:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:27,174 INFO L93 Difference]: Finished difference Result 2427 states and 3045 transitions. [2025-01-09 15:50:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:50:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 123 [2025-01-09 15:50:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:27,181 INFO L225 Difference]: With dead ends: 2427 [2025-01-09 15:50:27,181 INFO L226 Difference]: Without dead ends: 1693 [2025-01-09 15:50:27,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=1397, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 15:50:27,182 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 490 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:27,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1713 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:50:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-01-09 15:50:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1280. [2025-01-09 15:50:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1186 states have (on average 1.2293423271500843) internal successors, (1458), 1192 states have internal predecessors, (1458), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1594 transitions. [2025-01-09 15:50:27,317 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1594 transitions. Word has length 123 [2025-01-09 15:50:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:27,317 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1594 transitions. [2025-01-09 15:50:27,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 9 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-01-09 15:50:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1594 transitions. [2025-01-09 15:50:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:27,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:27,318 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:27,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:50:27,319 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:27,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2066594239, now seen corresponding path program 1 times [2025-01-09 15:50:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792423141] [2025-01-09 15:50:27,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:27,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792423141] [2025-01-09 15:50:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792423141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121202109] [2025-01-09 15:50:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:27,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:27,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:27,555 INFO L87 Difference]: Start difference. First operand 1280 states and 1594 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:27,962 INFO L93 Difference]: Finished difference Result 2402 states and 3005 transitions. [2025-01-09 15:50:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:50:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:27,967 INFO L225 Difference]: With dead ends: 2402 [2025-01-09 15:50:27,967 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 15:50:27,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:27,969 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 166 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:27,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 617 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 15:50:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1335. [2025-01-09 15:50:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1241 states have (on average 1.2240128928283642) internal successors, (1519), 1247 states have internal predecessors, (1519), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1655 transitions. [2025-01-09 15:50:28,171 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1655 transitions. Word has length 123 [2025-01-09 15:50:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1655 transitions. [2025-01-09 15:50:28,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1655 transitions. [2025-01-09 15:50:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:28,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:28,172 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:28,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:50:28,173 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1449130369, now seen corresponding path program 1 times [2025-01-09 15:50:28,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:28,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045848851] [2025-01-09 15:50:28,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:28,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045848851] [2025-01-09 15:50:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045848851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:28,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:50:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025024986] [2025-01-09 15:50:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:28,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:50:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:28,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:50:28,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:28,523 INFO L87 Difference]: Start difference. First operand 1335 states and 1655 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:29,050 INFO L93 Difference]: Finished difference Result 2646 states and 3291 transitions. [2025-01-09 15:50:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:29,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:50:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:29,058 INFO L225 Difference]: With dead ends: 2646 [2025-01-09 15:50:29,061 INFO L226 Difference]: Without dead ends: 1839 [2025-01-09 15:50:29,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:29,064 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 248 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:29,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1095 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-01-09 15:50:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1343. [2025-01-09 15:50:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1249 states have (on average 1.2209767814251402) internal successors, (1525), 1255 states have internal predecessors, (1525), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1661 transitions. [2025-01-09 15:50:29,219 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1661 transitions. Word has length 123 [2025-01-09 15:50:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:29,219 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1661 transitions. [2025-01-09 15:50:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1661 transitions. [2025-01-09 15:50:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:29,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:29,220 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:50:29,221 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -139217533, now seen corresponding path program 1 times [2025-01-09 15:50:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574608547] [2025-01-09 15:50:29,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:29,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:29,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574608547] [2025-01-09 15:50:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574608547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:50:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015451947] [2025-01-09 15:50:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:29,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:50:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:29,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:50:29,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:29,574 INFO L87 Difference]: Start difference. First operand 1343 states and 1661 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:30,179 INFO L93 Difference]: Finished difference Result 2727 states and 3372 transitions. [2025-01-09 15:50:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:50:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:50:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:30,184 INFO L225 Difference]: With dead ends: 2727 [2025-01-09 15:50:30,184 INFO L226 Difference]: Without dead ends: 1929 [2025-01-09 15:50:30,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:50:30,185 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 470 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:30,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1013 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-01-09 15:50:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1360. [2025-01-09 15:50:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1266 states have (on average 1.2235387045813586) internal successors, (1549), 1272 states have internal predecessors, (1549), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1685 transitions. [2025-01-09 15:50:30,345 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1685 transitions. Word has length 123 [2025-01-09 15:50:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1685 transitions. [2025-01-09 15:50:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1685 transitions. [2025-01-09 15:50:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:30,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:30,346 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:50:30,346 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:30,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1419081211, now seen corresponding path program 1 times [2025-01-09 15:50:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576081913] [2025-01-09 15:50:30,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:30,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:30,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:30,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576081913] [2025-01-09 15:50:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576081913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:50:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104037893] [2025-01-09 15:50:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:50:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:30,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:50:30,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:30,977 INFO L87 Difference]: Start difference. First operand 1360 states and 1685 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:32,455 INFO L93 Difference]: Finished difference Result 2867 states and 3521 transitions. [2025-01-09 15:50:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:50:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-01-09 15:50:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:32,460 INFO L225 Difference]: With dead ends: 2867 [2025-01-09 15:50:32,460 INFO L226 Difference]: Without dead ends: 2024 [2025-01-09 15:50:32,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:50:32,462 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 698 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:32,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1237 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:50:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2025-01-09 15:50:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1352. [2025-01-09 15:50:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1258 states have (on average 1.2217806041335453) internal successors, (1537), 1264 states have internal predecessors, (1537), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1673 transitions. [2025-01-09 15:50:32,689 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1673 transitions. Word has length 123 [2025-01-09 15:50:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1673 transitions. [2025-01-09 15:50:32,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1673 transitions. [2025-01-09 15:50:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:32,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:32,691 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:32,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:50:32,691 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1301291511, now seen corresponding path program 1 times [2025-01-09 15:50:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598511656] [2025-01-09 15:50:32,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:32,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:32,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:32,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598511656] [2025-01-09 15:50:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598511656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-01-09 15:50:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169989779] [2025-01-09 15:50:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:50:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:33,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:50:33,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:33,912 INFO L87 Difference]: Start difference. First operand 1352 states and 1673 transitions. Second operand has 26 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 24 states have internal predecessors, (56), 10 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 15:50:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:36,080 INFO L93 Difference]: Finished difference Result 2437 states and 3014 transitions. [2025-01-09 15:50:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:50:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 24 states have internal predecessors, (56), 10 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Word has length 123 [2025-01-09 15:50:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:36,084 INFO L225 Difference]: With dead ends: 2437 [2025-01-09 15:50:36,084 INFO L226 Difference]: Without dead ends: 1645 [2025-01-09 15:50:36,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 15:50:36,086 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 735 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:36,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1682 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:50:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-01-09 15:50:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1346. [2025-01-09 15:50:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1251 states have (on average 1.2206235011990407) internal successors, (1527), 1257 states have internal predecessors, (1527), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1663 transitions. [2025-01-09 15:50:36,239 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1663 transitions. Word has length 123 [2025-01-09 15:50:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:36,239 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1663 transitions. [2025-01-09 15:50:36,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 24 states have internal predecessors, (56), 10 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 15:50:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1663 transitions. [2025-01-09 15:50:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:36,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:36,240 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:36,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:50:36,241 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:36,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash -801743929, now seen corresponding path program 1 times [2025-01-09 15:50:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424587873] [2025-01-09 15:50:36,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:36,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:36,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:36,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:36,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424587873] [2025-01-09 15:50:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424587873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:36,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519311832] [2025-01-09 15:50:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:36,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:36,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:36,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:36,491 INFO L87 Difference]: Start difference. First operand 1346 states and 1663 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:36,889 INFO L93 Difference]: Finished difference Result 2598 states and 3227 transitions. [2025-01-09 15:50:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:50:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:36,893 INFO L225 Difference]: With dead ends: 2598 [2025-01-09 15:50:36,893 INFO L226 Difference]: Without dead ends: 1694 [2025-01-09 15:50:36,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:36,894 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 160 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 719 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-01-09 15:50:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1370. [2025-01-09 15:50:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1275 states have (on average 1.2164705882352942) internal successors, (1551), 1281 states have internal predecessors, (1551), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1687 transitions. [2025-01-09 15:50:37,053 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1687 transitions. Word has length 123 [2025-01-09 15:50:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:37,054 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1687 transitions. [2025-01-09 15:50:37,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1687 transitions. [2025-01-09 15:50:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:50:37,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:37,055 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:50:37,055 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:37,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 584459465, now seen corresponding path program 1 times [2025-01-09 15:50:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:37,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700650502] [2025-01-09 15:50:37,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:37,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:50:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:50:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:37,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:37,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700650502] [2025-01-09 15:50:37,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700650502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:37,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:50:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596957395] [2025-01-09 15:50:37,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:37,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:50:37,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:37,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:50:37,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:37,589 INFO L87 Difference]: Start difference. First operand 1370 states and 1687 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:38,734 INFO L93 Difference]: Finished difference Result 2504 states and 3080 transitions. [2025-01-09 15:50:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:50:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:50:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:38,738 INFO L225 Difference]: With dead ends: 2504 [2025-01-09 15:50:38,738 INFO L226 Difference]: Without dead ends: 1592 [2025-01-09 15:50:38,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:50:38,739 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 501 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1352 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:50:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-01-09 15:50:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1300. [2025-01-09 15:50:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1205 states have (on average 1.2141078838174273) internal successors, (1463), 1211 states have internal predecessors, (1463), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1599 transitions. [2025-01-09 15:50:38,883 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1599 transitions. Word has length 123 [2025-01-09 15:50:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:38,883 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1599 transitions. [2025-01-09 15:50:38,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1599 transitions. [2025-01-09 15:50:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:38,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:38,884 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 15:50:38,884 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1053305465, now seen corresponding path program 1 times [2025-01-09 15:50:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994492799] [2025-01-09 15:50:38,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:38,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994492799] [2025-01-09 15:50:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994492799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 15:50:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831530523] [2025-01-09 15:50:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 15:50:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 15:50:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:50:39,983 INFO L87 Difference]: Start difference. First operand 1300 states and 1599 transitions. Second operand has 23 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:50:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:41,940 INFO L93 Difference]: Finished difference Result 2673 states and 3293 transitions. [2025-01-09 15:50:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:50:41,940 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 125 [2025-01-09 15:50:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:41,944 INFO L225 Difference]: With dead ends: 2673 [2025-01-09 15:50:41,944 INFO L226 Difference]: Without dead ends: 1883 [2025-01-09 15:50:41,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 15:50:41,946 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 428 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:41,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 2394 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:50:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2025-01-09 15:50:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1355. [2025-01-09 15:50:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1260 states have (on average 1.211111111111111) internal successors, (1526), 1266 states have internal predecessors, (1526), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1662 transitions. [2025-01-09 15:50:42,097 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1662 transitions. Word has length 125 [2025-01-09 15:50:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:42,098 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1662 transitions. [2025-01-09 15:50:42,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 15:50:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1662 transitions. [2025-01-09 15:50:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:42,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:42,099 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:42,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 15:50:42,099 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -226558213, now seen corresponding path program 1 times [2025-01-09 15:50:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433835255] [2025-01-09 15:50:42,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:42,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:42,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:42,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:42,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433835255] [2025-01-09 15:50:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433835255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:50:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158540686] [2025-01-09 15:50:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:42,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:50:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:42,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:50:42,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:42,908 INFO L87 Difference]: Start difference. First operand 1355 states and 1662 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:43,970 INFO L93 Difference]: Finished difference Result 2706 states and 3316 transitions. [2025-01-09 15:50:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:50:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-01-09 15:50:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:43,974 INFO L225 Difference]: With dead ends: 2706 [2025-01-09 15:50:43,974 INFO L226 Difference]: Without dead ends: 1890 [2025-01-09 15:50:43,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:43,975 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 653 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:43,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1225 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:50:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2025-01-09 15:50:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1360. [2025-01-09 15:50:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1265 states have (on average 1.208695652173913) internal successors, (1529), 1271 states have internal predecessors, (1529), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1665 transitions. [2025-01-09 15:50:44,121 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1665 transitions. Word has length 125 [2025-01-09 15:50:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1665 transitions. [2025-01-09 15:50:44,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1665 transitions. [2025-01-09 15:50:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:44,123 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:44,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 15:50:44,123 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1754905339, now seen corresponding path program 1 times [2025-01-09 15:50:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69890100] [2025-01-09 15:50:44,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:44,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:44,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:44,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:44,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:44,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69890100] [2025-01-09 15:50:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69890100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535554803] [2025-01-09 15:50:44,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:44,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:44,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:44,262 INFO L87 Difference]: Start difference. First operand 1360 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:44,587 INFO L93 Difference]: Finished difference Result 2483 states and 3056 transitions. [2025-01-09 15:50:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:50:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:44,591 INFO L225 Difference]: With dead ends: 2483 [2025-01-09 15:50:44,591 INFO L226 Difference]: Without dead ends: 1600 [2025-01-09 15:50:44,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-01-09 15:50:44,592 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 79 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:44,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 552 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-01-09 15:50:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1295. [2025-01-09 15:50:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1200 states have (on average 1.2083333333333333) internal successors, (1450), 1206 states have internal predecessors, (1450), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1586 transitions. [2025-01-09 15:50:44,761 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1586 transitions. Word has length 125 [2025-01-09 15:50:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1586 transitions. [2025-01-09 15:50:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:50:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1586 transitions. [2025-01-09 15:50:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:44,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:44,763 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 15:50:44,763 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1573065587, now seen corresponding path program 1 times [2025-01-09 15:50:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384365376] [2025-01-09 15:50:44,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:44,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:44,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:44,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384365376] [2025-01-09 15:50:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384365376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:50:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485173304] [2025-01-09 15:50:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:50:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:50:45,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:45,323 INFO L87 Difference]: Start difference. First operand 1295 states and 1586 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:46,134 INFO L93 Difference]: Finished difference Result 2428 states and 2975 transitions. [2025-01-09 15:50:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:50:46,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 125 [2025-01-09 15:50:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:46,138 INFO L225 Difference]: With dead ends: 2428 [2025-01-09 15:50:46,138 INFO L226 Difference]: Without dead ends: 1644 [2025-01-09 15:50:46,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:46,140 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 330 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:46,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1312 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-01-09 15:50:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1289. [2025-01-09 15:50:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1194 states have (on average 1.2068676716917923) internal successors, (1441), 1200 states have internal predecessors, (1441), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1577 transitions. [2025-01-09 15:50:46,290 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1577 transitions. Word has length 125 [2025-01-09 15:50:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:46,290 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1577 transitions. [2025-01-09 15:50:46,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1577 transitions. [2025-01-09 15:50:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:46,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:46,291 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:46,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 15:50:46,291 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1403829045, now seen corresponding path program 1 times [2025-01-09 15:50:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853527619] [2025-01-09 15:50:46,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853527619] [2025-01-09 15:50:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853527619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:50:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986571684] [2025-01-09 15:50:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:50:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:50:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:46,839 INFO L87 Difference]: Start difference. First operand 1289 states and 1577 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:47,806 INFO L93 Difference]: Finished difference Result 2538 states and 3100 transitions. [2025-01-09 15:50:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:50:47,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 125 [2025-01-09 15:50:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:47,810 INFO L225 Difference]: With dead ends: 2538 [2025-01-09 15:50:47,811 INFO L226 Difference]: Without dead ends: 1710 [2025-01-09 15:50:47,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2025-01-09 15:50:47,812 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 673 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:47,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1309 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:50:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-01-09 15:50:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1289. [2025-01-09 15:50:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1194 states have (on average 1.2051926298157454) internal successors, (1439), 1200 states have internal predecessors, (1439), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1575 transitions. [2025-01-09 15:50:47,983 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1575 transitions. Word has length 125 [2025-01-09 15:50:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:47,983 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1575 transitions. [2025-01-09 15:50:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1575 transitions. [2025-01-09 15:50:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:50:47,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:47,984 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:47,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 15:50:47,984 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:47,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash -702229171, now seen corresponding path program 1 times [2025-01-09 15:50:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072871376] [2025-01-09 15:50:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:47,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:50:48,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:50:48,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:48,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072871376] [2025-01-09 15:50:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072871376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:50:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216017165] [2025-01-09 15:50:48,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:50:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:48,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:50:48,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:50:48,519 INFO L87 Difference]: Start difference. First operand 1289 states and 1575 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:49,640 INFO L93 Difference]: Finished difference Result 2388 states and 2926 transitions. [2025-01-09 15:50:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:50:49,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 125 [2025-01-09 15:50:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:49,644 INFO L225 Difference]: With dead ends: 2388 [2025-01-09 15:50:49,644 INFO L226 Difference]: Without dead ends: 1607 [2025-01-09 15:50:49,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2025-01-09 15:50:49,645 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 427 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:49,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1324 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:50:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-01-09 15:50:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1289. [2025-01-09 15:50:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1194 states have (on average 1.202680067001675) internal successors, (1436), 1200 states have internal predecessors, (1436), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1572 transitions. [2025-01-09 15:50:49,864 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1572 transitions. Word has length 125 [2025-01-09 15:50:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:49,864 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1572 transitions. [2025-01-09 15:50:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:50:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1572 transitions. [2025-01-09 15:50:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:50:49,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:49,865 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 15:50:49,865 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 662080445, now seen corresponding path program 1 times [2025-01-09 15:50:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547688879] [2025-01-09 15:50:49,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:49,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:50:49,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:50:49,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:49,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547688879] [2025-01-09 15:50:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547688879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787403239] [2025-01-09 15:50:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:50,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:50,171 INFO L87 Difference]: Start difference. First operand 1289 states and 1572 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:50,538 INFO L93 Difference]: Finished difference Result 2119 states and 2605 transitions. [2025-01-09 15:50:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:50,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-01-09 15:50:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:50,541 INFO L225 Difference]: With dead ends: 2119 [2025-01-09 15:50:50,541 INFO L226 Difference]: Without dead ends: 1335 [2025-01-09 15:50:50,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:50,543 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 165 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:50,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 478 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-01-09 15:50:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1085. [2025-01-09 15:50:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1006 states have (on average 1.2157057654075547) internal successors, (1223), 1008 states have internal predecessors, (1223), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:50:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1335 transitions. [2025-01-09 15:50:50,662 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1335 transitions. Word has length 126 [2025-01-09 15:50:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:50,662 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1335 transitions. [2025-01-09 15:50:50,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:50:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1335 transitions. [2025-01-09 15:50:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:50:50,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:50,664 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:50,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 15:50:50,665 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1135464703, now seen corresponding path program 1 times [2025-01-09 15:50:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622765567] [2025-01-09 15:50:50,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:50,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:50:50,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:50:50,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622765567] [2025-01-09 15:50:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622765567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:50:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948346556] [2025-01-09 15:50:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:51,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:50:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:51,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:50:51,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:51,205 INFO L87 Difference]: Start difference. First operand 1085 states and 1335 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:51,927 INFO L93 Difference]: Finished difference Result 1891 states and 2359 transitions. [2025-01-09 15:50:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:50:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 127 [2025-01-09 15:50:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:51,929 INFO L225 Difference]: With dead ends: 1891 [2025-01-09 15:50:51,929 INFO L226 Difference]: Without dead ends: 1251 [2025-01-09 15:50:51,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:50:51,930 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 262 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:51,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1289 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-09 15:50:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1146. [2025-01-09 15:50:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1067 states have (on average 1.2239925023430178) internal successors, (1306), 1069 states have internal predecessors, (1306), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:50:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1418 transitions. [2025-01-09 15:50:52,048 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1418 transitions. Word has length 127 [2025-01-09 15:50:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:52,048 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1418 transitions. [2025-01-09 15:50:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1418 transitions. [2025-01-09 15:50:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:50:52,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:52,049 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:52,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 15:50:52,049 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:52,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -625101047, now seen corresponding path program 1 times [2025-01-09 15:50:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:52,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269004819] [2025-01-09 15:50:52,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:52,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:50:52,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:50:52,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:50:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269004819] [2025-01-09 15:50:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269004819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 15:50:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696217095] [2025-01-09 15:50:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:52,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 15:50:52,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:52,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 15:50:52,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:50:52,973 INFO L87 Difference]: Start difference. First operand 1146 states and 1418 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:55,204 INFO L93 Difference]: Finished difference Result 2134 states and 2639 transitions. [2025-01-09 15:50:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 15:50:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 127 [2025-01-09 15:50:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:55,211 INFO L225 Difference]: With dead ends: 2134 [2025-01-09 15:50:55,211 INFO L226 Difference]: Without dead ends: 1433 [2025-01-09 15:50:55,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=1735, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 15:50:55,212 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 509 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:55,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 2609 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:50:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-01-09 15:50:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1146. [2025-01-09 15:50:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1067 states have (on average 1.2239925023430178) internal successors, (1306), 1069 states have internal predecessors, (1306), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:50:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1418 transitions. [2025-01-09 15:50:55,333 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1418 transitions. Word has length 127 [2025-01-09 15:50:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:55,334 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1418 transitions. [2025-01-09 15:50:55,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:50:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1418 transitions. [2025-01-09 15:50:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 15:50:55,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:55,336 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:55,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 15:50:55,336 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1703083635, now seen corresponding path program 1 times [2025-01-09 15:50:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947442294] [2025-01-09 15:50:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:55,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 15:50:55,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 15:50:55,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:55,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 15:50:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947442294] [2025-01-09 15:50:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947442294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006980394] [2025-01-09 15:50:55,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:55,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:55,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:50:55,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:50:55,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:50:55,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 15:50:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 15:50:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:56,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:50:56,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:56,731 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-01-09 15:50:56,918 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-01-09 15:50:57,160 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-01-09 15:50:57,173 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