./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-37.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 bb0766965719962bb88d82eca60f2d4be80ff0b6b6f05c2a75f9469a0fc9b6e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:02:56,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:02:56,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:02:56,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:02:56,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:02:56,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:02:56,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:02:56,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:02:56,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:02:56,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:02:56,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:02:56,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:02:56,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:02:56,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:02:56,427 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:02:56,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:02:56,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:02:56,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:02:56,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:02:56,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:56,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:02:56,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:02:56,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:02:56,430 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 -> bb0766965719962bb88d82eca60f2d4be80ff0b6b6f05c2a75f9469a0fc9b6e7 [2025-02-06 04:02:56,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:02:56,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:02:56,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:02:56,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:02:56,656 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:02:56,657 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-sp_file-37.i [2025-02-06 04:02:57,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f9b72104/c9e56747ca0f409aaacb2e35753e0103/FLAGa220e5789 [2025-02-06 04:02:58,080 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:02:58,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-37.i [2025-02-06 04:02:58,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f9b72104/c9e56747ca0f409aaacb2e35753e0103/FLAGa220e5789 [2025-02-06 04:02:58,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f9b72104/c9e56747ca0f409aaacb2e35753e0103 [2025-02-06 04:02:58,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:02:58,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:02:58,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:58,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:02:58,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:02:58,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d00928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58, skipping insertion in model container [2025-02-06 04:02:58,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:02:58,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-37.i[917,930] [2025-02-06 04:02:58,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:58,570 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:02:58,578 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-sp_file-37.i[917,930] [2025-02-06 04:02:58,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:58,621 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:02:58,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58 WrapperNode [2025-02-06 04:02:58,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:58,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:58,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:02:58,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:02:58,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,662 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2025-02-06 04:02:58,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:58,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:02:58,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:02:58,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:02:58,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,688 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:02:58,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:02:58,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:02:58,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:02:58,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:02:58,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (1/1) ... [2025-02-06 04:02:58,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:58,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:58,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:02:58,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:02:58,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:02:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:02:58,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:02:58,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:02:58,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:02:58,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:02:58,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:02:58,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:02:59,224 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 04:02:59,259 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-02-06 04:02:59,259 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:02:59,275 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:02:59,276 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:02:59,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:59 BoogieIcfgContainer [2025-02-06 04:02:59,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:02:59,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:02:59,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:02:59,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:02:59,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:02:58" (1/3) ... [2025-02-06 04:02:59,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e864714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:59, skipping insertion in model container [2025-02-06 04:02:59,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:58" (2/3) ... [2025-02-06 04:02:59,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e864714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:59, skipping insertion in model container [2025-02-06 04:02:59,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:59" (3/3) ... [2025-02-06 04:02:59,285 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-37.i [2025-02-06 04:02:59,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:02:59,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:02:59,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:02:59,350 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;@1f960c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:02:59,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:02:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 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-02-06 04:02:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:02:59,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:59,362 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] [2025-02-06 04:02:59,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash 772012318, now seen corresponding path program 1 times [2025-02-06 04:02:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666080353] [2025-02-06 04:02:59,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:59,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:02:59,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:02:59,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:59,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 04:02:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666080353] [2025-02-06 04:02:59,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666080353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126335834] [2025-02-06 04:02:59,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:59,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:02:59,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:02:59,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:02:59,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:02:59,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:59,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:59,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:02:59,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 04:02:59,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126335834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:02:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:02:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117987290] [2025-02-06 04:02:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:59,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:02:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:59,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:02:59,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:02:59,950 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-02-06 04:02:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:59,979 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-02-06 04:02:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:02:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 124 [2025-02-06 04:02:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:59,985 INFO L225 Difference]: With dead ends: 202 [2025-02-06 04:02:59,986 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 04:02:59,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:02:59,990 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:59,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 04:03:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 04:03:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 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-02-06 04:03:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-02-06 04:03:00,025 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-02-06 04:03:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:00,025 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-02-06 04:03:00,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-02-06 04:03:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-02-06 04:03:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:03:00,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:00,028 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] [2025-02-06 04:03:00,035 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-02-06 04:03:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:03:00,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:00,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1635328569, now seen corresponding path program 1 times [2025-02-06 04:03:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735772657] [2025-02-06 04:03:00,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:00,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:03:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:03:00,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:00,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:00,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735772657] [2025-02-06 04:03:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735772657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:00,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:00,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:03:00,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371804726] [2025-02-06 04:03:00,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:03:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:00,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:03:00,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:00,550 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:00,618 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2025-02-06 04:03:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:03:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 04:03:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:00,621 INFO L225 Difference]: With dead ends: 202 [2025-02-06 04:03:00,621 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 04:03:00,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:00,623 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:00,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 04:03:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 04:03:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-02-06 04:03:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-02-06 04:03:00,638 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-02-06 04:03:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:00,640 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-02-06 04:03:00,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-02-06 04:03:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:03:00,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:00,641 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] [2025-02-06 04:03:00,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:03:00,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 852184264, now seen corresponding path program 1 times [2025-02-06 04:03:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:00,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785804790] [2025-02-06 04:03:00,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:00,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:03:00,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:03:00,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:00,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:00,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785804790] [2025-02-06 04:03:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785804790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:03:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858021046] [2025-02-06 04:03:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:00,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:03:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:00,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:03:00,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:00,817 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:00,846 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-02-06 04:03:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:03:00,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 04:03:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:00,849 INFO L225 Difference]: With dead ends: 206 [2025-02-06 04:03:00,849 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 04:03:00,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:00,850 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:00,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 04:03:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 04:03:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 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-02-06 04:03:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-02-06 04:03:00,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-02-06 04:03:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:00,857 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-02-06 04:03:00,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-02-06 04:03:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:03:00,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:00,860 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] [2025-02-06 04:03:00,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:03:00,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:00,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1739687945, now seen corresponding path program 1 times [2025-02-06 04:03:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682773696] [2025-02-06 04:03:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:00,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:03:00,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:03:00,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:00,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682773696] [2025-02-06 04:03:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682773696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:01,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:03:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144852829] [2025-02-06 04:03:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:01,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:03:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:01,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:03:01,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:01,033 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:01,062 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-02-06 04:03:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:03:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 04:03:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:01,064 INFO L225 Difference]: With dead ends: 210 [2025-02-06 04:03:01,066 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 04:03:01,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:01,067 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:01,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 04:03:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-06 04:03:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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-02-06 04:03:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-02-06 04:03:01,073 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-02-06 04:03:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:01,073 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-02-06 04:03:01,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:03:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-02-06 04:03:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:03:01,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:01,074 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] [2025-02-06 04:03:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:03:01,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1740611466, now seen corresponding path program 1 times [2025-02-06 04:03:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799399813] [2025-02-06 04:03:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:01,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:03:01,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:03:01,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799399813] [2025-02-06 04:03:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799399813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:02,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:02,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:03:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903483873] [2025-02-06 04:03:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:03:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:02,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:03:02,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:03:02,196 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-02-06 04:03:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:02,558 INFO L93 Difference]: Finished difference Result 213 states and 305 transitions. [2025-02-06 04:03:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:03:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 124 [2025-02-06 04:03:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:02,560 INFO L225 Difference]: With dead ends: 213 [2025-02-06 04:03:02,561 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 04:03:02,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:02,562 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:02,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 360 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:03:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 04:03:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-02-06 04:03:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 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-02-06 04:03:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2025-02-06 04:03:02,569 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 124 [2025-02-06 04:03:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:02,570 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2025-02-06 04:03:02,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-02-06 04:03:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2025-02-06 04:03:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:03:02,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:02,573 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-02-06 04:03:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:03:02,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1913723188, now seen corresponding path program 1 times [2025-02-06 04:03:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994186972] [2025-02-06 04:03:02,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:02,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:02,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:03:03,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994186972] [2025-02-06 04:03:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994186972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561439778] [2025-02-06 04:03:03,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:03,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:03:03,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:03:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:03,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:03,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:03,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 04:03:03,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:04,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:04,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:05,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:05,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:05,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:05,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:05,571 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 04:03:05,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2025-02-06 04:03:05,582 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 04:03:05,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-02-06 04:03:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 122 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 04:03:05,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:03:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561439778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:05,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:03:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-02-06 04:03:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000667838] [2025-02-06 04:03:05,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:03:05,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:03:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:05,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:03:05,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:03:05,658 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 15 states have internal predecessors, (94), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2025-02-06 04:03:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:06,409 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2025-02-06 04:03:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:03:06,411 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 15 states have internal predecessors, (94), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 127 [2025-02-06 04:03:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:06,412 INFO L225 Difference]: With dead ends: 233 [2025-02-06 04:03:06,412 INFO L226 Difference]: Without dead ends: 129 [2025-02-06 04:03:06,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-02-06 04:03:06,413 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 224 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:06,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 532 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:03:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-06 04:03:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2025-02-06 04:03:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.31) internal successors, (131), 101 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 04:03:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-02-06 04:03:06,425 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 127 [2025-02-06 04:03:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:06,425 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-02-06 04:03:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 15 states have internal predecessors, (94), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2025-02-06 04:03:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-02-06 04:03:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:03:06,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:06,427 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-02-06 04:03:06,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:03:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:06,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1658986643, now seen corresponding path program 1 times [2025-02-06 04:03:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951835019] [2025-02-06 04:03:06,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:06,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:06,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:06,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:06,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951835019] [2025-02-06 04:03:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951835019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:03:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20696965] [2025-02-06 04:03:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:07,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:03:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:07,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:03:07,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:03:07,416 INFO L87 Difference]: Start difference. First operand 124 states and 173 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-02-06 04:03:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:07,789 INFO L93 Difference]: Finished difference Result 232 states and 324 transitions. [2025-02-06 04:03:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:03:07,791 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-02-06 04:03:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:07,793 INFO L225 Difference]: With dead ends: 232 [2025-02-06 04:03:07,793 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 04:03:07,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:03:07,794 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 238 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 273 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:03:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 04:03:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 04:03:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.3) internal successors, (130), 101 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 04:03:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2025-02-06 04:03:07,810 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 127 [2025-02-06 04:03:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:07,811 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2025-02-06 04:03:07,811 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-02-06 04:03:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2025-02-06 04:03:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:03:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:07,812 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-02-06 04:03:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:03:07,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:07,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1128428844, now seen corresponding path program 1 times [2025-02-06 04:03:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508106431] [2025-02-06 04:03:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:07,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:07,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:03:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508106431] [2025-02-06 04:03:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508106431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517227481] [2025-02-06 04:03:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:10,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:03:10,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:03:10,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:10,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:10,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:10,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 04:03:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:11,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-02-06 04:03:11,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:03:12,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:03:12,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:03:13,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:03:14,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:03:14,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:03:15,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:03:15,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:15,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 04:03:16,000 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2025-02-06 04:03:16,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 112 [2025-02-06 04:03:16,005 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:03:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 158 proven. 152 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 04:03:16,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:03:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517227481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:16,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:03:16,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-02-06 04:03:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670987665] [2025-02-06 04:03:16,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:03:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:03:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:16,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:03:16,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-02-06 04:03:16,157 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 10 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 10 states have call successors, (30) [2025-02-06 04:03:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:17,873 INFO L93 Difference]: Finished difference Result 258 states and 343 transitions. [2025-02-06 04:03:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 04:03:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 10 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 10 states have call successors, (30) Word has length 127 [2025-02-06 04:03:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:17,879 INFO L225 Difference]: With dead ends: 258 [2025-02-06 04:03:17,879 INFO L226 Difference]: Without dead ends: 150 [2025-02-06 04:03:17,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=311, Invalid=1495, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 04:03:17,880 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 308 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:17,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 635 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:03:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-06 04:03:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2025-02-06 04:03:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:03:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2025-02-06 04:03:17,901 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 127 [2025-02-06 04:03:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:17,902 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2025-02-06 04:03:17,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 26 states have internal predecessors, (100), 10 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 10 states have call successors, (30) [2025-02-06 04:03:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2025-02-06 04:03:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:03:17,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:17,903 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-02-06 04:03:17,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:03:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:18,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:18,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1097409037, now seen corresponding path program 1 times [2025-02-06 04:03:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890127003] [2025-02-06 04:03:18,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:18,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:18,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:18,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:18,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:19,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890127003] [2025-02-06 04:03:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890127003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:19,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:03:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387718263] [2025-02-06 04:03:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:03:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:19,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:03:19,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:03:19,618 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 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-02-06 04:03:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:20,848 INFO L93 Difference]: Finished difference Result 339 states and 449 transitions. [2025-02-06 04:03:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:03:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 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-02-06 04:03:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:20,850 INFO L225 Difference]: With dead ends: 339 [2025-02-06 04:03:20,850 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 04:03:20,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:03:20,851 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 436 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:20,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 582 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:03:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 04:03:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 141. [2025-02-06 04:03:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:03:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2025-02-06 04:03:20,868 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 127 [2025-02-06 04:03:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:20,868 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2025-02-06 04:03:20,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 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-02-06 04:03:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2025-02-06 04:03:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:03:20,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:20,869 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-02-06 04:03:20,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:03:20,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:20,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1602967662, now seen corresponding path program 1 times [2025-02-06 04:03:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:20,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507763503] [2025-02-06 04:03:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:03:20,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:03:20,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:20,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:21,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507763503] [2025-02-06 04:03:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507763503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:03:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628730726] [2025-02-06 04:03:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:21,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:03:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:03:21,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:03:21,693 INFO L87 Difference]: Start difference. First operand 141 states and 188 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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-02-06 04:03:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:22,101 INFO L93 Difference]: Finished difference Result 284 states and 379 transitions. [2025-02-06 04:03:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:22,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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-02-06 04:03:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:22,104 INFO L225 Difference]: With dead ends: 284 [2025-02-06 04:03:22,104 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 04:03:22,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:03:22,105 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 320 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:22,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 709 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:03:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 04:03:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-02-06 04:03:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:03:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2025-02-06 04:03:22,139 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 127 [2025-02-06 04:03:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:22,140 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2025-02-06 04:03:22,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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-02-06 04:03:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2025-02-06 04:03:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:22,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:22,141 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] [2025-02-06 04:03:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:03:22,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1845663610, now seen corresponding path program 1 times [2025-02-06 04:03:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193234428] [2025-02-06 04:03:22,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:22,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:22,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:03:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193234428] [2025-02-06 04:03:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193234428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:23,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:23,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:03:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679658225] [2025-02-06 04:03:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:03:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:23,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:03:23,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:03:23,511 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-02-06 04:03:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:24,222 INFO L93 Difference]: Finished difference Result 280 states and 373 transitions. [2025-02-06 04:03:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:03:24,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 128 [2025-02-06 04:03:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:24,228 INFO L225 Difference]: With dead ends: 280 [2025-02-06 04:03:24,228 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 04:03:24,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:03:24,229 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 171 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:24,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 438 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:03:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 04:03:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 121. [2025-02-06 04:03:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.27) internal successors, (127), 100 states have internal predecessors, (127), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:03:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 157 transitions. [2025-02-06 04:03:24,248 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 157 transitions. Word has length 128 [2025-02-06 04:03:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:24,248 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 157 transitions. [2025-02-06 04:03:24,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-02-06 04:03:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2025-02-06 04:03:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:03:24,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:24,249 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] [2025-02-06 04:03:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:03:24,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1287724333, now seen corresponding path program 1 times [2025-02-06 04:03:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191342667] [2025-02-06 04:03:24,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:24,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:03:24,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:03:24,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:24,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:03:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191342667] [2025-02-06 04:03:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191342667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674046525] [2025-02-06 04:03:27,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:27,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:03:27,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:03:27,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:03:27,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:03:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:27,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 04:03:27,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:28,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:29,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:29,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:30,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:30,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2025-02-06 04:03:30,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 50 [2025-02-06 04:03:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:30,920 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 04:03:30,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 57 [2025-02-06 04:03:31,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,130 INFO L349 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2025-02-06 04:03:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 74 [2025-02-06 04:03:31,348 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-02-06 04:03:31,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 170 treesize of output 152 [2025-02-06 04:03:31,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:31,689 INFO L349 Elim1Store]: treesize reduction 555, result has 17.5 percent of original size [2025-02-06 04:03:31,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 39 case distinctions, treesize of input 207 treesize of output 390