./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.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-58.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 ecf82f73685a389a6d8ab3479ee5cabf8a5c47771e1a4d141e5607a0c68dd324 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:48:34,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:48:34,373 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:48:34,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:48:34,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:48:34,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:48:34,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:48:34,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:48:34,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:48:34,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:48:34,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:48:34,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:48:34,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:48:34,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:48:34,406 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:48:34,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:48:34,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:48:34,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:48:34,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:34,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:34,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:48:34,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:48:34,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:48:34,408 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 -> ecf82f73685a389a6d8ab3479ee5cabf8a5c47771e1a4d141e5607a0c68dd324 [2025-01-09 15:48:34,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:48:34,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:48:34,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:48:34,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:48:34,663 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:48:34,665 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-58.i [2025-01-09 15:48:35,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb89ee13/43ea6699a3474e7f962b95789c029961/FLAG510a13cac [2025-01-09 15:48:36,097 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:48:36,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i [2025-01-09 15:48:36,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb89ee13/43ea6699a3474e7f962b95789c029961/FLAG510a13cac [2025-01-09 15:48:36,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb89ee13/43ea6699a3474e7f962b95789c029961 [2025-01-09 15:48:36,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:48:36,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:48:36,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:36,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:48:36,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:48:36,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc66c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36, skipping insertion in model container [2025-01-09 15:48:36,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:48:36,543 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-58.i[916,929] [2025-01-09 15:48:36,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:36,609 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:48:36,619 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-58.i[916,929] [2025-01-09 15:48:36,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:36,672 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:48:36,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36 WrapperNode [2025-01-09 15:48:36,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:36,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:36,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:48:36,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:48:36,680 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:48:36" (1/1) ... [2025-01-09 15:48:36,693 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:48:36" (1/1) ... [2025-01-09 15:48:36,731 INFO L138 Inliner]: procedures = 26, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2025-01-09 15:48:36,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:36,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:48:36,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:48:36,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:48:36,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,778 INFO L175 MemorySlicer]: Split 125 memory accesses to 12 slices as follows [2, 7, 28, 16, 8, 12, 7, 11, 6, 19, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1]. [2025-01-09 15:48:36,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:48:36,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:48:36,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:48:36,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:48:36,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (1/1) ... [2025-01-09 15:48:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:36,846 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:48:36,849 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:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:48:36,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:48:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:48:36,985 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:48:36,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:48:37,320 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:48:37,322 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:48:37,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:48:37,329 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:48:37,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:37 BoogieIcfgContainer [2025-01-09 15:48:37,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:48:37,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:48:37,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:48:37,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:48:37,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:36" (1/3) ... [2025-01-09 15:48:37,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d6c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:37, skipping insertion in model container [2025-01-09 15:48:37,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:36" (2/3) ... [2025-01-09 15:48:37,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d6c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:37, skipping insertion in model container [2025-01-09 15:48:37,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:37" (3/3) ... [2025-01-09 15:48:37,336 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-58.i [2025-01-09 15:48:37,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:48:37,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-58.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:48:37,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:48:37,402 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;@116ffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:48:37,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:48:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:48:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:37,417 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -908927882, now seen corresponding path program 1 times [2025-01-09 15:48:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:37,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867831450] [2025-01-09 15:48:37,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:37,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:48:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:37,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867831450] [2025-01-09 15:48:37,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867831450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061731042] [2025-01-09 15:48:37,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:37,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:37,672 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:48:37,674 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:48:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:37,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:37,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:48:37,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:48:37,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061731042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:48:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093855811] [2025-01-09 15:48:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:37,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:48:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:37,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:48:37,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:48:37,935 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:48:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:37,958 INFO L93 Difference]: Finished difference Result 172 states and 266 transitions. [2025-01-09 15:48:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:48:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-01-09 15:48:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:37,963 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:48:37,963 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:48:37,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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:48:37,967 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:48:37,967 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:48:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:48:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:48:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:48:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-01-09 15:48:38,000 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2025-01-09 15:48:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:38,002 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-01-09 15:48:38,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:48:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-01-09 15:48:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:38,007 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:48:38,207 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:48:38,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1393763052, now seen corresponding path program 1 times [2025-01-09 15:48:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756386119] [2025-01-09 15:48:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:38,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756386119] [2025-01-09 15:48:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756386119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:38,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:38,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:48:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038438511] [2025-01-09 15:48:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:38,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:48:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:38,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:48:38,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:48:38,473 INFO L87 Difference]: Start difference. First operand 84 states and 118 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:38,505 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2025-01-09 15:48:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:48:38,506 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:48:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:38,507 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:48:38,507 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 15:48:38,508 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:48:38,508 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:38,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 15:48:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-01-09 15:48:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:48:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2025-01-09 15:48:38,515 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2025-01-09 15:48:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:38,516 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-01-09 15:48:38,517 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2025-01-09 15:48:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:38,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:38,520 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:48:38,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1391916010, now seen corresponding path program 1 times [2025-01-09 15:48:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781713295] [2025-01-09 15:48:38,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:38,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781713295] [2025-01-09 15:48:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781713295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:39,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:39,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:48:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021118884] [2025-01-09 15:48:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:48:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:39,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:48:39,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:39,648 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:40,020 INFO L93 Difference]: Finished difference Result 214 states and 299 transitions. [2025-01-09 15:48:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:48:40,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-01-09 15:48:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:40,024 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:48:40,024 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 15:48:40,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 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:48:40,025 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 364 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:40,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 532 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 15:48:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2025-01-09 15:48:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:48:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2025-01-09 15:48:40,044 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 116 [2025-01-09 15:48:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:40,045 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2025-01-09 15:48:40,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2025-01-09 15:48:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:40,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:40,046 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:48:40,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1133750572, now seen corresponding path program 1 times [2025-01-09 15:48:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584812295] [2025-01-09 15:48:40,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:40,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:40,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:40,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584812295] [2025-01-09 15:48:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584812295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:48:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928664074] [2025-01-09 15:48:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:48:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:40,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:48:40,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:40,884 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:48:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:41,329 INFO L93 Difference]: Finished difference Result 244 states and 339 transitions. [2025-01-09 15:48:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:48:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2025-01-09 15:48:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:41,331 INFO L225 Difference]: With dead ends: 244 [2025-01-09 15:48:41,332 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 15:48:41,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:48:41,334 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 375 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:41,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 470 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 15:48:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2025-01-09 15:48:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:48:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 186 transitions. [2025-01-09 15:48:41,355 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 186 transitions. Word has length 116 [2025-01-09 15:48:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:41,355 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 186 transitions. [2025-01-09 15:48:41,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:48:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 186 transitions. [2025-01-09 15:48:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:41,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:41,357 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:48:41,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:41,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash -920340371, now seen corresponding path program 1 times [2025-01-09 15:48:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031976449] [2025-01-09 15:48:41,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:41,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031976449] [2025-01-09 15:48:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031976449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787996184] [2025-01-09 15:48:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:41,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:41,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:41,561 INFO L87 Difference]: Start difference. First operand 135 states and 186 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:41,736 INFO L93 Difference]: Finished difference Result 352 states and 485 transitions. [2025-01-09 15:48:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:41,736 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:48:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:41,738 INFO L225 Difference]: With dead ends: 352 [2025-01-09 15:48:41,738 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 15:48:41,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:41,739 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 106 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:41,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 535 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 15:48:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-01-09 15:48:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 181 states have internal predecessors, (231), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:48:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 299 transitions. [2025-01-09 15:48:41,774 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 299 transitions. Word has length 116 [2025-01-09 15:48:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:41,775 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 299 transitions. [2025-01-09 15:48:41,775 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 299 transitions. [2025-01-09 15:48:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:41,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:41,776 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:48:41,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1314703384, now seen corresponding path program 1 times [2025-01-09 15:48:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318677004] [2025-01-09 15:48:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:41,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:41,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:41,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318677004] [2025-01-09 15:48:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318677004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:48:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965868795] [2025-01-09 15:48:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:42,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:42,051 INFO L87 Difference]: Start difference. First operand 218 states and 299 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:42,234 INFO L93 Difference]: Finished difference Result 472 states and 648 transitions. [2025-01-09 15:48:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:48:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:42,238 INFO L225 Difference]: With dead ends: 472 [2025-01-09 15:48:42,238 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 15:48:42,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:42,239 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 72 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:42,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 660 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 15:48:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2025-01-09 15:48:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 195 states have internal predecessors, (250), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:48:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2025-01-09 15:48:42,267 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 116 [2025-01-09 15:48:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:42,267 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2025-01-09 15:48:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2025-01-09 15:48:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:48:42,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:42,269 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:48:42,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1572868822, now seen corresponding path program 1 times [2025-01-09 15:48:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829927587] [2025-01-09 15:48:42,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:42,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:48:42,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:48:42,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:42,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829927587] [2025-01-09 15:48:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829927587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131645011] [2025-01-09 15:48:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:42,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:42,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:42,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:42,649 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:42,793 INFO L93 Difference]: Finished difference Result 498 states and 681 transitions. [2025-01-09 15:48:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-01-09 15:48:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:42,796 INFO L225 Difference]: With dead ends: 498 [2025-01-09 15:48:42,796 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 15:48:42,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:42,797 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 66 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:42,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 938 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 15:48:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2025-01-09 15:48:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 228 states have (on average 1.2850877192982457) internal successors, (293), 231 states have internal predecessors, (293), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:48:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 373 transitions. [2025-01-09 15:48:42,827 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 373 transitions. Word has length 116 [2025-01-09 15:48:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:42,827 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 373 transitions. [2025-01-09 15:48:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 373 transitions. [2025-01-09 15:48:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:48:42,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:42,828 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:48:42,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1865089623, now seen corresponding path program 1 times [2025-01-09 15:48:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042620812] [2025-01-09 15:48:42,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:42,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:48:42,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:48:42,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:42,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042620812] [2025-01-09 15:48:43,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042620812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:43,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:43,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115959446] [2025-01-09 15:48:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:43,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:43,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:43,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:43,019 INFO L87 Difference]: Start difference. First operand 275 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:43,187 INFO L93 Difference]: Finished difference Result 530 states and 720 transitions. [2025-01-09 15:48:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-01-09 15:48:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:43,190 INFO L225 Difference]: With dead ends: 530 [2025-01-09 15:48:43,191 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 15:48:43,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:43,192 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 107 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:43,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 445 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 15:48:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2025-01-09 15:48:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 189 states have internal predecessors, (233), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2025-01-09 15:48:43,222 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 117 [2025-01-09 15:48:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2025-01-09 15:48:43,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2025-01-09 15:48:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:48:43,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:43,224 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:48:43,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1393513984, now seen corresponding path program 1 times [2025-01-09 15:48:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370877591] [2025-01-09 15:48:43,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:43,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:48:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:48:43,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:43,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370877591] [2025-01-09 15:48:43,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370877591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041121077] [2025-01-09 15:48:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:43,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:43,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:43,643 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:43,959 INFO L93 Difference]: Finished difference Result 493 states and 660 transitions. [2025-01-09 15:48:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-01-09 15:48:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:43,961 INFO L225 Difference]: With dead ends: 493 [2025-01-09 15:48:43,962 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 15:48:43,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:48:43,963 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 283 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:43,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 425 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 15:48:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 244. [2025-01-09 15:48:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 201 states have internal predecessors, (249), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 325 transitions. [2025-01-09 15:48:43,986 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 325 transitions. Word has length 117 [2025-01-09 15:48:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:43,987 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 325 transitions. [2025-01-09 15:48:43,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 325 transitions. [2025-01-09 15:48:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:48:43,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:43,988 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:43,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:48:43,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1135348546, now seen corresponding path program 1 times [2025-01-09 15:48:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513633562] [2025-01-09 15:48:43,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:48:44,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:48:44,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513633562] [2025-01-09 15:48:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513633562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579080753] [2025-01-09 15:48:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:44,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:44,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:44,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:44,368 INFO L87 Difference]: Start difference. First operand 244 states and 325 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:44,558 INFO L93 Difference]: Finished difference Result 513 states and 684 transitions. [2025-01-09 15:48:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:48:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-01-09 15:48:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:44,560 INFO L225 Difference]: With dead ends: 513 [2025-01-09 15:48:44,560 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 15:48:44,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:44,561 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:44,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 998 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 15:48:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 269. [2025-01-09 15:48:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 224 states have (on average 1.2633928571428572) internal successors, (283), 226 states have internal predecessors, (283), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2025-01-09 15:48:44,585 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 117 [2025-01-09 15:48:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:44,586 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2025-01-09 15:48:44,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:48:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2025-01-09 15:48:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:48:44,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:44,589 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:48:44,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 600630722, now seen corresponding path program 1 times [2025-01-09 15:48:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:44,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43904982] [2025-01-09 15:48:44,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:48:44,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:48:44,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43904982] [2025-01-09 15:48:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43904982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:45,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:48:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355498125] [2025-01-09 15:48:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:48:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:45,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:48:45,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:45,172 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:45,730 INFO L93 Difference]: Finished difference Result 540 states and 720 transitions. [2025-01-09 15:48:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:48:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-01-09 15:48:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:45,732 INFO L225 Difference]: With dead ends: 540 [2025-01-09 15:48:45,733 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 15:48:45,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:48:45,734 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 279 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:45,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 815 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:48:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 15:48:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2025-01-09 15:48:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 227 states have (on average 1.2599118942731278) internal successors, (286), 229 states have internal predecessors, (286), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 362 transitions. [2025-01-09 15:48:45,773 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 362 transitions. Word has length 117 [2025-01-09 15:48:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 362 transitions. [2025-01-09 15:48:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 362 transitions. [2025-01-09 15:48:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:48:45,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:45,775 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:48:45,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:45,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 858796160, now seen corresponding path program 1 times [2025-01-09 15:48:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315246980] [2025-01-09 15:48:45,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:45,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:48:45,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:48:45,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:46,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315246980] [2025-01-09 15:48:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315246980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:46,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:46,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:48:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246289693] [2025-01-09 15:48:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:46,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:48:46,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:46,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:48:46,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:46,319 INFO L87 Difference]: Start difference. First operand 272 states and 362 transitions. Second operand has 12 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:48:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:46,813 INFO L93 Difference]: Finished difference Result 542 states and 720 transitions. [2025-01-09 15:48:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:48:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 117 [2025-01-09 15:48:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:46,817 INFO L225 Difference]: With dead ends: 542 [2025-01-09 15:48:46,817 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 15:48:46,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:48:46,819 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 159 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:46,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 592 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 15:48:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2025-01-09 15:48:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 357 transitions. [2025-01-09 15:48:46,844 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 357 transitions. Word has length 117 [2025-01-09 15:48:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:46,844 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 357 transitions. [2025-01-09 15:48:46,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:48:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 357 transitions. [2025-01-09 15:48:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:48:46,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:46,846 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:46,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:48:46,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -462948857, now seen corresponding path program 1 times [2025-01-09 15:48:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449296871] [2025-01-09 15:48:46,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:46,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:48:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:48:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:48:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449296871] [2025-01-09 15:48:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449296871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498394035] [2025-01-09 15:48:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:47,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:47,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:47,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:47,229 INFO L87 Difference]: Start difference. First operand 269 states and 357 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:47,506 INFO L93 Difference]: Finished difference Result 700 states and 919 transitions. [2025-01-09 15:48:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:48:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2025-01-09 15:48:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:47,509 INFO L225 Difference]: With dead ends: 700 [2025-01-09 15:48:47,509 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 15:48:47,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:47,511 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 184 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:47,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 595 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 15:48:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 302. [2025-01-09 15:48:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.2334630350194553) internal successors, (317), 259 states have internal predecessors, (317), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:48:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 393 transitions. [2025-01-09 15:48:47,535 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 393 transitions. Word has length 118 [2025-01-09 15:48:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:47,535 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 393 transitions. [2025-01-09 15:48:47,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:48:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2025-01-09 15:48:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:48:47,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:47,537 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:48:47,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:47,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1652607263, now seen corresponding path program 1 times [2025-01-09 15:48:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353371028] [2025-01-09 15:48:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:47,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:48:47,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:48:47,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:47,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:48:48,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:48,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353371028] [2025-01-09 15:48:48,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353371028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:48,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58003635] [2025-01-09 15:48:48,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:48,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:48,963 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:48:48,964 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:48:49,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:48:52,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:48:52,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:52,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 15:48:52,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:52,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:48:53,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:48:54,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:48:55,112 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:48:56,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:48:56,356 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-01-09 15:48:56,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2025-01-09 15:49:02,790 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 59 treesize of output 43 [2025-01-09 15:49:02,800 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 46 treesize of output 34 [2025-01-09 15:49:02,835 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 41 treesize of output 29 [2025-01-09 15:49:02,840 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 38 treesize of output 26 [2025-01-09 15:49:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 352 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 15:49:03,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:03,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58003635] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:03,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:49:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21, 37] total 62 [2025-01-09 15:49:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768456922] [2025-01-09 15:49:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:03,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:03,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:03,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3545, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 15:49:03,943 INFO L87 Difference]: Start difference. First operand 302 states and 393 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:04,456 INFO L93 Difference]: Finished difference Result 712 states and 919 transitions. [2025-01-09 15:49:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 15:49:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:04,460 INFO L225 Difference]: With dead ends: 712 [2025-01-09 15:49:04,461 INFO L226 Difference]: Without dead ends: 413 [2025-01-09 15:49:04,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=254, Invalid=3778, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 15:49:04,462 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 188 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:04,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 473 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-09 15:49:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 272. [2025-01-09 15:49:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 229 states have (on average 1.2139737991266375) internal successors, (278), 230 states have internal predecessors, (278), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 350 transitions. [2025-01-09 15:49:04,485 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 350 transitions. Word has length 119 [2025-01-09 15:49:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 350 transitions. [2025-01-09 15:49:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 350 transitions. [2025-01-09 15:49:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:49:04,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:04,487 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,497 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:04,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:04,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:04,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash 208696864, now seen corresponding path program 1 times [2025-01-09 15:49:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30459998] [2025-01-09 15:49:04,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:04,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:49:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:49:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30459998] [2025-01-09 15:49:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30459998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011348550] [2025-01-09 15:49:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:05,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:05,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:05,161 INFO L87 Difference]: Start difference. First operand 272 states and 350 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:49:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:05,397 INFO L93 Difference]: Finished difference Result 309 states and 392 transitions. [2025-01-09 15:49:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2025-01-09 15:49:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:05,400 INFO L225 Difference]: With dead ends: 309 [2025-01-09 15:49:05,400 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 15:49:05,400 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:05,401 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 159 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:05,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 601 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 15:49:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 250. [2025-01-09 15:49:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 206 states have (on average 1.1941747572815533) internal successors, (246), 207 states have internal predecessors, (246), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2025-01-09 15:49:05,423 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 120 [2025-01-09 15:49:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:05,423 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2025-01-09 15:49:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 15:49:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2025-01-09 15:49:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:49:05,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:05,425 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:49:05,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash 210543906, now seen corresponding path program 1 times [2025-01-09 15:49:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831868360] [2025-01-09 15:49:05,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:05,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:49:05,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:49:05,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:05,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831868360] [2025-01-09 15:49:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831868360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:12,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:49:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324444551] [2025-01-09 15:49:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:49:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:12,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:49:12,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:49:12,930 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:49:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:14,140 INFO L93 Difference]: Finished difference Result 624 states and 792 transitions. [2025-01-09 15:49:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:49:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-01-09 15:49:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:14,143 INFO L225 Difference]: With dead ends: 624 [2025-01-09 15:49:14,143 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 15:49:14,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:49:14,144 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 698 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:14,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 686 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:49:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 15:49:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 362. [2025-01-09 15:49:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.229559748427673) internal successors, (391), 319 states have internal predecessors, (391), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 463 transitions. [2025-01-09 15:49:14,167 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 463 transitions. Word has length 120 [2025-01-09 15:49:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:14,168 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 463 transitions. [2025-01-09 15:49:14,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:49:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 463 transitions. [2025-01-09 15:49:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:49:14,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:14,168 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:49:14,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:14,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1673293695, now seen corresponding path program 1 times [2025-01-09 15:49:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:14,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482554681] [2025-01-09 15:49:14,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:14,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:49:14,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:49:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482554681] [2025-01-09 15:49:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482554681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755834025] [2025-01-09 15:49:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:14,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:14,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:14,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:14,586 INFO L87 Difference]: Start difference. First operand 362 states and 463 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:15,317 INFO L93 Difference]: Finished difference Result 757 states and 967 transitions. [2025-01-09 15:49:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-01-09 15:49:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:15,319 INFO L225 Difference]: With dead ends: 757 [2025-01-09 15:49:15,319 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 15:49:15,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:15,320 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 158 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:15,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 711 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:49:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 15:49:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 362. [2025-01-09 15:49:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.2232704402515724) internal successors, (389), 319 states have internal predecessors, (389), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 461 transitions. [2025-01-09 15:49:15,341 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 461 transitions. Word has length 120 [2025-01-09 15:49:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 461 transitions. [2025-01-09 15:49:15,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 461 transitions. [2025-01-09 15:49:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:49:15,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:15,342 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:49:15,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:15,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1944801509, now seen corresponding path program 1 times [2025-01-09 15:49:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340972043] [2025-01-09 15:49:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:15,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:49:15,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:49:15,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:15,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340972043] [2025-01-09 15:49:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340972043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:49:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995535142] [2025-01-09 15:49:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:16,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:49:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:16,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:49:16,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:16,053 INFO L87 Difference]: Start difference. First operand 362 states and 461 transitions. Second operand has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:49:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:16,929 INFO L93 Difference]: Finished difference Result 804 states and 1017 transitions. [2025-01-09 15:49:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:49:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 121 [2025-01-09 15:49:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:16,932 INFO L225 Difference]: With dead ends: 804 [2025-01-09 15:49:16,932 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 15:49:16,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:49:16,933 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 239 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 720 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:49:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 15:49:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 370. [2025-01-09 15:49:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 326 states have (on average 1.2177914110429449) internal successors, (397), 327 states have internal predecessors, (397), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 469 transitions. [2025-01-09 15:49:16,955 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 469 transitions. Word has length 121 [2025-01-09 15:49:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:16,956 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 469 transitions. [2025-01-09 15:49:16,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:49:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 469 transitions. [2025-01-09 15:49:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:49:16,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:16,957 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:49:16,957 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:16,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 980672603, now seen corresponding path program 1 times [2025-01-09 15:49:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610670897] [2025-01-09 15:49:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:16,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:49:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:49:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:17,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:17,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610670897] [2025-01-09 15:49:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610670897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:17,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:17,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:49:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853021340] [2025-01-09 15:49:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:17,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:49:17,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:17,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:49:17,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:17,624 INFO L87 Difference]: Start difference. First operand 370 states and 469 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:49:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:18,512 INFO L93 Difference]: Finished difference Result 749 states and 945 transitions. [2025-01-09 15:49:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:49:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 121 [2025-01-09 15:49:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:18,514 INFO L225 Difference]: With dead ends: 749 [2025-01-09 15:49:18,514 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 15:49:18,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:49:18,515 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 406 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:18,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 800 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:49:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 15:49:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 362. [2025-01-09 15:49:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.2169811320754718) internal successors, (387), 319 states have internal predecessors, (387), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2025-01-09 15:49:18,565 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 121 [2025-01-09 15:49:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:18,565 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2025-01-09 15:49:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 15:49:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2025-01-09 15:49:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:49:18,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:18,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:49:18,568 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:18,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1036227532, now seen corresponding path program 1 times [2025-01-09 15:49:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827392900] [2025-01-09 15:49:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:18,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:49:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:49:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827392900] [2025-01-09 15:49:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827392900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:49:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204963980] [2025-01-09 15:49:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:18,846 INFO L87 Difference]: Start difference. First operand 362 states and 459 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:19,101 INFO L93 Difference]: Finished difference Result 728 states and 916 transitions. [2025-01-09 15:49:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:19,102 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2025-01-09 15:49:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:19,103 INFO L225 Difference]: With dead ends: 728 [2025-01-09 15:49:19,104 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 15:49:19,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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:49:19,104 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 240 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:19,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 525 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 15:49:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 356. [2025-01-09 15:49:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 312 states have (on average 1.2083333333333333) internal successors, (377), 313 states have internal predecessors, (377), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 449 transitions. [2025-01-09 15:49:19,126 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 449 transitions. Word has length 121 [2025-01-09 15:49:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:19,126 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 449 transitions. [2025-01-09 15:49:19,126 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 449 transitions. [2025-01-09 15:49:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:49:19,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:19,127 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:49:19,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1762532093, now seen corresponding path program 1 times [2025-01-09 15:49:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570317150] [2025-01-09 15:49:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:19,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:49:19,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:49:19,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:19,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570317150] [2025-01-09 15:49:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570317150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:49:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626468283] [2025-01-09 15:49:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:49:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:19,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:49:19,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:49:19,731 INFO L87 Difference]: Start difference. First operand 356 states and 449 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:49:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:20,483 INFO L93 Difference]: Finished difference Result 860 states and 1069 transitions. [2025-01-09 15:49:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:49:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 122 [2025-01-09 15:49:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:20,486 INFO L225 Difference]: With dead ends: 860 [2025-01-09 15:49:20,486 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 15:49:20,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:49:20,489 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 438 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:20,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1233 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:49:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 15:49:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2025-01-09 15:49:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 458 states have (on average 1.1943231441048034) internal successors, (547), 461 states have internal predecessors, (547), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 639 transitions. [2025-01-09 15:49:20,544 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 639 transitions. Word has length 122 [2025-01-09 15:49:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:20,545 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 639 transitions. [2025-01-09 15:49:20,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:49:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 639 transitions. [2025-01-09 15:49:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:49:20,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:20,546 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:49:20,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:20,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash -861351033, now seen corresponding path program 1 times [2025-01-09 15:49:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559349716] [2025-01-09 15:49:20,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:49:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:49:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559349716] [2025-01-09 15:49:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559349716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909272103] [2025-01-09 15:49:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:20,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:20,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:20,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:20,846 INFO L87 Difference]: Start difference. First operand 518 states and 639 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:20,998 INFO L93 Difference]: Finished difference Result 1180 states and 1453 transitions. [2025-01-09 15:49:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 15:49:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:21,001 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 15:49:21,001 INFO L226 Difference]: Without dead ends: 686 [2025-01-09 15:49:21,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:21,005 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 58 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:21,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 847 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-01-09 15:49:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 564. [2025-01-09 15:49:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 504 states have (on average 1.1924603174603174) internal successors, (601), 507 states have internal predecessors, (601), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 693 transitions. [2025-01-09 15:49:21,045 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 693 transitions. Word has length 122 [2025-01-09 15:49:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:21,045 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 693 transitions. [2025-01-09 15:49:21,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 693 transitions. [2025-01-09 15:49:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:49:21,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:21,046 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:49:21,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:21,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2114514803, now seen corresponding path program 1 times [2025-01-09 15:49:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287260445] [2025-01-09 15:49:21,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:21,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:49:21,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:49:21,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 45 proven. 63 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 15:49:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287260445] [2025-01-09 15:49:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287260445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935282916] [2025-01-09 15:49:22,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:22,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:22,515 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:49:22,517 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:49:22,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:49:23,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:49:23,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:23,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:23,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-01-09 15:49:23,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:23,915 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:49:24,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:49:25,365 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:49:26,180 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:49:27,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:49:27,946 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 44 treesize of output 32 [2025-01-09 15:49:27,961 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:49:37,286 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 74 treesize of output 54 [2025-01-09 15:49:37,292 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 44 treesize of output 32 [2025-01-09 15:49:37,296 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 58 treesize of output 42 [2025-01-09 15:49:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 7 proven. 369 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 15:49:38,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935282916] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:49:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21, 47] total 75 [2025-01-09 15:49:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529675356] [2025-01-09 15:49:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:42,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:42,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=5213, Unknown=0, NotChecked=0, Total=5550 [2025-01-09 15:49:42,146 INFO L87 Difference]: Start difference. First operand 564 states and 693 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:43,068 INFO L93 Difference]: Finished difference Result 1245 states and 1528 transitions. [2025-01-09 15:49:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:43,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 15:49:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:43,071 INFO L225 Difference]: With dead ends: 1245 [2025-01-09 15:49:43,071 INFO L226 Difference]: Without dead ends: 705 [2025-01-09 15:49:43,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=387, Invalid=5775, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 15:49:43,074 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 243 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:43,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 575 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:49:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-01-09 15:49:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 576. [2025-01-09 15:49:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 516 states have (on average 1.195736434108527) internal successors, (617), 519 states have internal predecessors, (617), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 709 transitions. [2025-01-09 15:49:43,112 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 709 transitions. Word has length 122 [2025-01-09 15:49:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 709 transitions. [2025-01-09 15:49:43,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 709 transitions. [2025-01-09 15:49:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:49:43,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:43,114 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:49:43,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:43,314 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1922287055, now seen corresponding path program 1 times [2025-01-09 15:49:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035544126] [2025-01-09 15:49:43,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:49:43,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:49:43,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:43,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035544126] [2025-01-09 15:49:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035544126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570297140] [2025-01-09 15:49:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:43,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:43,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:43,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:43,773 INFO L87 Difference]: Start difference. First operand 576 states and 709 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:44,431 INFO L93 Difference]: Finished difference Result 1151 states and 1412 transitions. [2025-01-09 15:49:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:49:44,431 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2025-01-09 15:49:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:44,434 INFO L225 Difference]: With dead ends: 1151 [2025-01-09 15:49:44,434 INFO L226 Difference]: Without dead ends: 599 [2025-01-09 15:49:44,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:49:44,436 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 225 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:44,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 726 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:49:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-09 15:49:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 564. [2025-01-09 15:49:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 504 states have (on average 1.1884920634920635) internal successors, (599), 507 states have internal predecessors, (599), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 691 transitions. [2025-01-09 15:49:44,491 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 691 transitions. Word has length 122 [2025-01-09 15:49:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 691 transitions. [2025-01-09 15:49:44,491 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 691 transitions. [2025-01-09 15:49:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:49:44,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:44,492 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:49:44,493 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:44,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1171920054, now seen corresponding path program 1 times [2025-01-09 15:49:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343069362] [2025-01-09 15:49:44,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:44,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:49:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:49:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343069362] [2025-01-09 15:49:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343069362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25523996] [2025-01-09 15:49:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:44,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:44,935 INFO L87 Difference]: Start difference. First operand 564 states and 691 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,241 INFO L93 Difference]: Finished difference Result 1191 states and 1463 transitions. [2025-01-09 15:49:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:45,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-01-09 15:49:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,243 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 15:49:45,243 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 15:49:45,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:45,245 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 155 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 531 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 15:49:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 570. [2025-01-09 15:49:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 510 states have (on average 1.1862745098039216) internal successors, (605), 513 states have internal predecessors, (605), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 697 transitions. [2025-01-09 15:49:45,311 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 697 transitions. Word has length 127 [2025-01-09 15:49:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 697 transitions. [2025-01-09 15:49:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 697 transitions. [2025-01-09 15:49:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:49:45,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,313 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:49:45,313 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1430085492, now seen corresponding path program 1 times [2025-01-09 15:49:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244398640] [2025-01-09 15:49:45,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:45,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:49:45,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:49:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244398640] [2025-01-09 15:49:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244398640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94480328] [2025-01-09 15:49:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:45,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:45,435 INFO L87 Difference]: Start difference. First operand 570 states and 697 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:45,561 INFO L93 Difference]: Finished difference Result 1274 states and 1552 transitions. [2025-01-09 15:49:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 15:49:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:45,564 INFO L225 Difference]: With dead ends: 1274 [2025-01-09 15:49:45,565 INFO L226 Difference]: Without dead ends: 728 [2025-01-09 15:49:45,565 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,566 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:45,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 510 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-01-09 15:49:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 724. [2025-01-09 15:49:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 630 states have (on average 1.1587301587301588) internal successors, (730), 636 states have internal predecessors, (730), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 874 transitions. [2025-01-09 15:49:45,647 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 874 transitions. Word has length 127 [2025-01-09 15:49:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 874 transitions. [2025-01-09 15:49:45,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 874 transitions. [2025-01-09 15:49:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:49:45,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:45,648 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:49:45,648 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1353136364, now seen corresponding path program 1 times [2025-01-09 15:49:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491007476] [2025-01-09 15:49:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:45,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:49:45,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:49:45,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:45,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491007476] [2025-01-09 15:49:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491007476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216013669] [2025-01-09 15:49:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:45,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:45,961 INFO L87 Difference]: Start difference. First operand 724 states and 874 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:46,227 INFO L93 Difference]: Finished difference Result 1389 states and 1666 transitions. [2025-01-09 15:49:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 15:49:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:46,230 INFO L225 Difference]: With dead ends: 1389 [2025-01-09 15:49:46,230 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 15:49:46,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:46,241 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 31 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:46,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 505 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 15:49:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 655. [2025-01-09 15:49:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 561 states have (on average 1.1301247771836007) internal successors, (634), 567 states have internal predecessors, (634), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 778 transitions. [2025-01-09 15:49:46,414 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 778 transitions. Word has length 127 [2025-01-09 15:49:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:46,415 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 778 transitions. [2025-01-09 15:49:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 778 transitions. [2025-01-09 15:49:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:49:46,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:46,417 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:49:46,417 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:46,418 INFO L85 PathProgramCache]: Analyzing trace with hash 402120985, now seen corresponding path program 1 times [2025-01-09 15:49:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625149999] [2025-01-09 15:49:46,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:46,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:49:46,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:49:46,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:46,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:49:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625149999] [2025-01-09 15:49:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625149999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994871758] [2025-01-09 15:49:48,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:48,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:48,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:48,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:49:48,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:49:49,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:49:49,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:49,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:49,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:49:49,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:49,276 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:49:49,596 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-09 15:49:49,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 108 [2025-01-09 15:49:49,649 INFO L349 Elim1Store]: treesize reduction 60, result has 13.0 percent of original size [2025-01-09 15:49:49,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 125 [2025-01-09 15:49:49,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-01-09 15:49:49,892 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 89 treesize of output 69 [2025-01-09 15:49:49,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2025-01-09 15:49:49,998 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 65 treesize of output 45 [2025-01-09 15:49:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-09 15:49:50,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:50,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 15:49:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994871758] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:49:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23, 14] total 36 [2025-01-09 15:49:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160463693] [2025-01-09 15:49:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:49:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:49:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:49:51,123 INFO L87 Difference]: Start difference. First operand 655 states and 778 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:52,065 INFO L93 Difference]: Finished difference Result 1526 states and 1800 transitions. [2025-01-09 15:49:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-01-09 15:49:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:52,069 INFO L225 Difference]: With dead ends: 1526 [2025-01-09 15:49:52,070 INFO L226 Difference]: Without dead ends: 895 [2025-01-09 15:49:52,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 247 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=1837, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 15:49:52,072 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 56 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:52,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1429 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:49:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-01-09 15:49:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 785. [2025-01-09 15:49:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 691 states have (on average 1.1230101302460203) internal successors, (776), 697 states have internal predecessors, (776), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 920 transitions. [2025-01-09 15:49:52,138 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 920 transitions. Word has length 132 [2025-01-09 15:49:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:52,138 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 920 transitions. [2025-01-09 15:49:52,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 920 transitions. [2025-01-09 15:49:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:49:52,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:52,139 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:49:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 15:49:52,340 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -184685029, now seen corresponding path program 1 times [2025-01-09 15:49:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:52,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405955847] [2025-01-09 15:49:52,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:52,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:49:52,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:49:52,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:52,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405955847] [2025-01-09 15:49:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405955847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988847389] [2025-01-09 15:49:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:52,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:52,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:52,556 INFO L87 Difference]: Start difference. First operand 785 states and 920 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:52,901 INFO L93 Difference]: Finished difference Result 1658 states and 1942 transitions. [2025-01-09 15:49:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-01-09 15:49:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:52,904 INFO L225 Difference]: With dead ends: 1658 [2025-01-09 15:49:52,904 INFO L226 Difference]: Without dead ends: 897 [2025-01-09 15:49:52,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:52,911 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 191 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:52,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 741 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-01-09 15:49:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 785. [2025-01-09 15:49:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 691 states have (on average 1.1114327062228655) internal successors, (768), 697 states have internal predecessors, (768), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 912 transitions. [2025-01-09 15:49:52,975 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 912 transitions. Word has length 132 [2025-01-09 15:49:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 912 transitions. [2025-01-09 15:49:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 912 transitions. [2025-01-09 15:49:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:49:52,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:52,976 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:49:52,976 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1969618277, now seen corresponding path program 1 times [2025-01-09 15:49:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68831770] [2025-01-09 15:49:52,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:52,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:49:53,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:49:53,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:53,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68831770] [2025-01-09 15:49:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68831770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963423019] [2025-01-09 15:49:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:53,116 INFO L87 Difference]: Start difference. First operand 785 states and 912 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:53,292 INFO L93 Difference]: Finished difference Result 1456 states and 1696 transitions. [2025-01-09 15:49:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-01-09 15:49:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:53,295 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 15:49:53,295 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 15:49:53,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:53,296 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 93 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:53,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 520 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 15:49:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2025-01-09 15:49:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 601 states have (on average 1.1048252911813643) internal successors, (664), 607 states have internal predecessors, (664), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 808 transitions. [2025-01-09 15:49:53,358 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 808 transitions. Word has length 132 [2025-01-09 15:49:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 808 transitions. [2025-01-09 15:49:53,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:49:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 808 transitions. [2025-01-09 15:49:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:49:53,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:53,360 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:49:53,360 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:53,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1670068867, now seen corresponding path program 1 times [2025-01-09 15:49:53,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:53,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966866112] [2025-01-09 15:49:53,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:53,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:53,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:49:53,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:49:53,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:53,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966866112] [2025-01-09 15:49:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966866112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704214949] [2025-01-09 15:49:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:53,733 INFO L87 Difference]: Start difference. First operand 695 states and 808 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:54,247 INFO L93 Difference]: Finished difference Result 1492 states and 1729 transitions. [2025-01-09 15:49:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:49:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2025-01-09 15:49:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:54,250 INFO L225 Difference]: With dead ends: 1492 [2025-01-09 15:49:54,250 INFO L226 Difference]: Without dead ends: 821 [2025-01-09 15:49:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:49:54,251 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 344 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:54,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 699 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-01-09 15:49:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 779. [2025-01-09 15:49:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 685 states have (on average 1.1036496350364964) internal successors, (756), 691 states have internal predecessors, (756), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 900 transitions. [2025-01-09 15:49:54,321 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 900 transitions. Word has length 133 [2025-01-09 15:49:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:54,322 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 900 transitions. [2025-01-09 15:49:54,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 900 transitions. [2025-01-09 15:49:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:49:54,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:54,323 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:49:54,323 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -114864381, now seen corresponding path program 1 times [2025-01-09 15:49:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233063517] [2025-01-09 15:49:54,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:54,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:49:54,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:49:54,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:54,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233063517] [2025-01-09 15:49:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233063517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:54,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:49:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206604474] [2025-01-09 15:49:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:49:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:54,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:49:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:54,791 INFO L87 Difference]: Start difference. First operand 779 states and 900 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:55,259 INFO L93 Difference]: Finished difference Result 1519 states and 1756 transitions. [2025-01-09 15:49:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2025-01-09 15:49:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:55,261 INFO L225 Difference]: With dead ends: 1519 [2025-01-09 15:49:55,261 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 15:49:55,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:49:55,263 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 251 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:55,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 739 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 15:49:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 741. [2025-01-09 15:49:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 647 states have (on average 1.1004636785162287) internal successors, (712), 653 states have internal predecessors, (712), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:49:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 856 transitions. [2025-01-09 15:49:55,335 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 856 transitions. Word has length 133 [2025-01-09 15:49:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 856 transitions. [2025-01-09 15:49:55,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 15:49:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 856 transitions. [2025-01-09 15:49:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:49:55,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:55,337 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:49:55,337 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1238695035, now seen corresponding path program 1 times [2025-01-09 15:49:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200818548] [2025-01-09 15:49:55,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:55,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:49:55,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:49:55,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:55,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:49:55,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:55,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200818548] [2025-01-09 15:49:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200818548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:49:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348822998] [2025-01-09 15:49:55,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:55,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:49:55,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:55,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:49:55,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:55,963 INFO L87 Difference]: Start difference. First operand 741 states and 856 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15)