./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:06:20,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:06:20,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:06:20,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:06:20,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:06:20,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:06:20,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:06:20,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:06:20,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:06:20,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:06:20,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:06:20,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:06:20,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:06:20,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:06:20,827 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:06:20,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:06:20,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:06:20,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:06:20,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:06:20,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:06:20,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:20,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:06:20,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:06:20,833 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/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 -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2025-03-17 06:06:21,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:06:21,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:06:21,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:06:21,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:06:21,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:06:21,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2025-03-17 06:06:23,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5751a9b/1504e44f48944bc89137f86f6b149e12/FLAGa9c3a5f80 [2025-03-17 06:06:23,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:06:23,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2025-03-17 06:06:23,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5751a9b/1504e44f48944bc89137f86f6b149e12/FLAGa9c3a5f80 [2025-03-17 06:06:23,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5751a9b/1504e44f48944bc89137f86f6b149e12 [2025-03-17 06:06:23,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:06:23,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:06:23,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:23,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:06:23,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:06:23,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:23" (1/1) ... [2025-03-17 06:06:23,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f3f2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:23, skipping insertion in model container [2025-03-17 06:06:23,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:23" (1/1) ... [2025-03-17 06:06:23,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:06:24,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2025-03-17 06:06:24,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:24,260 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:06:24,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2025-03-17 06:06:24,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:24,404 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:06:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24 WrapperNode [2025-03-17 06:06:24,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:24,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:24,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:06:24,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:06:24,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,513 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-03-17 06:06:24,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:24,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:06:24,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:06:24,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:06:24,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,567 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:06:24,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:06:24,637 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:06:24,638 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:06:24,638 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:06:24,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (1/1) ... [2025-03-17 06:06:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:24,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:24,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:06:24,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:06:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:06:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:06:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:06:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:06:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:06:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:06:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:06:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:06:24,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:06:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:06:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:06:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:06:24,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:06:24,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:06:25,779 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem68#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem74#1;havoc property_#t~ite81#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~short82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~bitwise92#1;havoc property_#t~ite107#1;havoc property_#t~mem102#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-17 06:06:25,855 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-17 06:06:25,855 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:06:25,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:06:25,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:06:25,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:25 BoogieIcfgContainer [2025-03-17 06:06:25,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:06:25,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:06:25,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:06:25,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:06:25,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:06:23" (1/3) ... [2025-03-17 06:06:25,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41907fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:25, skipping insertion in model container [2025-03-17 06:06:25,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:24" (2/3) ... [2025-03-17 06:06:25,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41907fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:25, skipping insertion in model container [2025-03-17 06:06:25,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:25" (3/3) ... [2025-03-17 06:06:25,911 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2025-03-17 06:06:25,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:06:25,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-22.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:06:26,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:06:26,065 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;@3061a251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:06:26,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:06:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 06:06:26,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:26,090 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:26,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash -734421179, now seen corresponding path program 1 times [2025-03-17 06:06:26,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266187450] [2025-03-17 06:06:26,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:26,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 06:06:26,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 06:06:26,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:26,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 06:06:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266187450] [2025-03-17 06:06:26,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266187450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:06:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971169425] [2025-03-17 06:06:26,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:26,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:26,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:26,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:06:26,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 06:06:27,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 06:06:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:27,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:06:27,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 06:06:27,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971169425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:06:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:06:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605406052] [2025-03-17 06:06:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:06:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:27,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:06:27,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:06:27,193 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:27,245 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2025-03-17 06:06:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:06:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-17 06:06:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:27,257 INFO L225 Difference]: With dead ends: 195 [2025-03-17 06:06:27,260 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 06:06:27,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-03-17 06:06:27,270 INFO L435 NwaCegarLoop]: 140 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, 140 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-03-17 06:06:27,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 06:06:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 06:06:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2025-03-17 06:06:27,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 86 [2025-03-17 06:06:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2025-03-17 06:06:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2025-03-17 06:06:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 06:06:27,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:27,358 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:27,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:06:27,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:06:27,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:27,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1949276444, now seen corresponding path program 1 times [2025-03-17 06:06:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:27,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849658607] [2025-03-17 06:06:27,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:27,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 06:06:27,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 06:06:27,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:27,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:30,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849658607] [2025-03-17 06:06:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849658607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:06:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76790662] [2025-03-17 06:06:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:30,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:06:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:30,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:06:30,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:06:30,616 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:31,345 INFO L93 Difference]: Finished difference Result 320 states and 473 transitions. [2025-03-17 06:06:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:06:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-03-17 06:06:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:31,348 INFO L225 Difference]: With dead ends: 320 [2025-03-17 06:06:31,350 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 06:06:31,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:06:31,352 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 223 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:31,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 329 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:06:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 06:06:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 141. [2025-03-17 06:06:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.4166666666666667) internal successors, (170), 120 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:06:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 206 transitions. [2025-03-17 06:06:31,388 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 206 transitions. Word has length 86 [2025-03-17 06:06:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 206 transitions. [2025-03-17 06:06:31,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 206 transitions. [2025-03-17 06:06:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 06:06:31,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:31,394 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:06:31,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 975918434, now seen corresponding path program 1 times [2025-03-17 06:06:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660207881] [2025-03-17 06:06:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:31,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 06:06:31,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 06:06:31,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660207881] [2025-03-17 06:06:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660207881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:32,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:06:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981963639] [2025-03-17 06:06:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:06:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:32,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:06:32,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:06:32,038 INFO L87 Difference]: Start difference. First operand 141 states and 206 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:32,447 INFO L93 Difference]: Finished difference Result 390 states and 572 transitions. [2025-03-17 06:06:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:06:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2025-03-17 06:06:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:32,450 INFO L225 Difference]: With dead ends: 390 [2025-03-17 06:06:32,452 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 06:06:32,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:06:32,453 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 209 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:32,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 381 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 06:06:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2025-03-17 06:06:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 205 states have (on average 1.4341463414634146) internal successors, (294), 205 states have internal predecessors, (294), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 06:06:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 348 transitions. [2025-03-17 06:06:32,490 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 348 transitions. Word has length 87 [2025-03-17 06:06:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 348 transitions. [2025-03-17 06:06:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 348 transitions. [2025-03-17 06:06:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 06:06:32,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:32,494 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:32,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:06:32,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:32,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1770968901, now seen corresponding path program 1 times [2025-03-17 06:06:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733718720] [2025-03-17 06:06:32,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:32,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 06:06:32,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 06:06:32,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733718720] [2025-03-17 06:06:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733718720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691255580] [2025-03-17 06:06:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:32,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:32,590 INFO L87 Difference]: Start difference. First operand 236 states and 348 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:32,664 INFO L93 Difference]: Finished difference Result 349 states and 516 transitions. [2025-03-17 06:06:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-17 06:06:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:32,667 INFO L225 Difference]: With dead ends: 349 [2025-03-17 06:06:32,667 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 06:06:32,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:32,668 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:32,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:06:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 06:06:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2025-03-17 06:06:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.403361344537815) internal successors, (167), 119 states have internal predecessors, (167), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:06:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-03-17 06:06:32,693 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 88 [2025-03-17 06:06:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:32,694 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-03-17 06:06:32,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-03-17 06:06:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 06:06:32,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:32,695 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:32,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:06:32,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -909028384, now seen corresponding path program 1 times [2025-03-17 06:06:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:32,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449602627] [2025-03-17 06:06:32,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:32,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 06:06:32,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 06:06:32,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:32,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:34,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449602627] [2025-03-17 06:06:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449602627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:34,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:06:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059905094] [2025-03-17 06:06:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:34,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:06:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:34,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:06:34,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:06:34,438 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:35,471 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2025-03-17 06:06:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:06:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2025-03-17 06:06:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:35,473 INFO L225 Difference]: With dead ends: 315 [2025-03-17 06:06:35,473 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 06:06:35,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:06:35,474 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 185 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:35,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 384 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:06:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 06:06:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 141. [2025-03-17 06:06:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.4) internal successors, (168), 120 states have internal predecessors, (168), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:06:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-17 06:06:35,506 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 90 [2025-03-17 06:06:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:35,506 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-17 06:06:35,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-17 06:06:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 06:06:35,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:35,513 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:35,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:06:35,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:35,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1623213595, now seen corresponding path program 1 times [2025-03-17 06:06:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039686697] [2025-03-17 06:06:35,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:35,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 06:06:35,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 06:06:35,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:35,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039686697] [2025-03-17 06:06:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039686697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:36,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25639622] [2025-03-17 06:06:36,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:36,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:36,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:36,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:36,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:36,430 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:36,514 INFO L93 Difference]: Finished difference Result 253 states and 367 transitions. [2025-03-17 06:06:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2025-03-17 06:06:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:36,517 INFO L225 Difference]: With dead ends: 253 [2025-03-17 06:06:36,517 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 06:06:36,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:36,517 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 25 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:36,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 264 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:06:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 06:06:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2025-03-17 06:06:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:06:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2025-03-17 06:06:36,549 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 90 [2025-03-17 06:06:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:36,549 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2025-03-17 06:06:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2025-03-17 06:06:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 06:06:36,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:36,550 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:36,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:06:36,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1417734681, now seen corresponding path program 1 times [2025-03-17 06:06:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674945727] [2025-03-17 06:06:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 06:06:36,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 06:06:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:06:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674945727] [2025-03-17 06:06:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674945727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:06:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225470805] [2025-03-17 06:06:38,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:38,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:38,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:38,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:06:39,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 06:06:39,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 06:06:39,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:39,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:39,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 06:06:39,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:39,457 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 55 treesize of output 54 [2025-03-17 06:06:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 90 [2025-03-17 06:06:42,557 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 11 treesize of output 9 [2025-03-17 06:06:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:42,713 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 21 treesize of output 22 [2025-03-17 06:06:43,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,183 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 34 treesize of output 25 [2025-03-17 06:06:43,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:06:43,354 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 34 treesize of output 25 [2025-03-17 06:06:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:06:43,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:06:43,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_651 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse1 (mod (+ 65520 (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (not (= v_ArrVal_651 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< 32767 .cse1) (not (= (+ 65536 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) .cse1)))))) (forall ((v_ArrVal_651 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse3 (mod (+ 65520 (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (not (= v_ArrVal_651 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< .cse3 32768) (= (+ 65536 (select (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) .cse3))))) (forall ((v_ArrVal_651 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse6 (mod (+ 65520 (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536)) (.cse5 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (not (= v_ArrVal_651 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= (+ 65536 .cse5) .cse6) (= .cse6 .cse5))))))) is different from false [2025-03-17 06:06:44,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((|ULTIMATE.start_step_#t~ite23#1| Int) (v_ArrVal_651 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse0 (mod (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (= .cse0 (+ 65536 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse0 32768) (not (= v_ArrVal_651 (store (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))))) (forall ((|ULTIMATE.start_step_#t~ite23#1| Int) (v_ArrVal_651 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse7 (store .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse4 (mod (+ (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536)) (.cse5 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (= .cse4 .cse5) (= .cse4 (+ 65536 .cse5)) (not (= v_ArrVal_651 (store (select .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))))) (forall ((|ULTIMATE.start_step_#t~ite23#1| Int) (v_ArrVal_651 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse9 (store .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_651))) (let ((.cse8 (mod (+ (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (< 32767 .cse8) (not (= .cse8 (+ 65536 (select (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))) (not (= v_ArrVal_651 (store (select .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_651 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))))))) is different from false [2025-03-17 06:06:46,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:46,357 INFO L349 Elim1Store]: treesize reduction 58, result has 50.0 percent of original size [2025-03-17 06:06:46,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 376 treesize of output 113 [2025-03-17 06:06:46,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:46,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 233 [2025-03-17 06:06:46,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-03-17 06:06:47,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:47,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 107 treesize of output 105 [2025-03-17 06:06:48,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:48,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 140 treesize of output 136 [2025-03-17 06:06:48,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:48,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 107 treesize of output 105 [2025-03-17 06:06:48,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:48,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2263 treesize of output 2033 [2025-03-17 06:06:49,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-17 06:06:49,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:49,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2537 treesize of output 2211 [2025-03-17 06:06:51,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:51,348 INFO L349 Elim1Store]: treesize reduction 115, result has 0.9 percent of original size [2025-03-17 06:06:51,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 305 treesize of output 1 [2025-03-17 06:06:51,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:51,369 INFO L349 Elim1Store]: treesize reduction 115, result has 0.9 percent of original size [2025-03-17 06:06:51,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 306 treesize of output 1 [2025-03-17 06:06:51,422 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:51,508 INFO L349 Elim1Store]: treesize reduction 60, result has 50.0 percent of original size [2025-03-17 06:06:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 396 treesize of output 115 [2025-03-17 06:06:51,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:51,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 235 [2025-03-17 06:06:52,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 865 treesize of output 809 [2025-03-17 06:06:56,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:56,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1339 treesize of output 1199 [2025-03-17 06:06:57,312 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,317 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,320 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 06:06:57,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,329 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 06:06:57,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,343 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 06:06:57,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:57,351 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 06:06:57,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:57,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5885 treesize of output 5045 [2025-03-17 06:06:59,543 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:59,557 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2025-03-17 06:06:59,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 1 [2025-03-17 06:06:59,564 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:06:59,582 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2025-03-17 06:06:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 1 [2025-03-17 06:07:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225470805] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:07:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 11] total 29 [2025-03-17 06:07:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094349262] [2025-03-17 06:07:00,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:07:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:00,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:07:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=621, Unknown=3, NotChecked=102, Total=812 [2025-03-17 06:07:00,619 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:01,643 INFO L93 Difference]: Finished difference Result 292 states and 418 transitions. [2025-03-17 06:07:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:07:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-03-17 06:07:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:01,648 INFO L225 Difference]: With dead ends: 292 [2025-03-17 06:07:01,651 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 06:07:01,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=106, Invalid=769, Unknown=3, NotChecked=114, Total=992 [2025-03-17 06:07:01,658 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 214 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:01,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 446 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 413 Unchecked, 0.5s Time] [2025-03-17 06:07:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 06:07:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 161. [2025-03-17 06:07:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2025-03-17 06:07:01,687 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 91 [2025-03-17 06:07:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2025-03-17 06:07:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2025-03-17 06:07:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:07:01,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:01,692 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:01,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:07:01,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 06:07:01,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 638282124, now seen corresponding path program 1 times [2025-03-17 06:07:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087314005] [2025-03-17 06:07:01,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:01,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:07:02,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:07:02,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:02,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087314005] [2025-03-17 06:07:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087314005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:07:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413650114] [2025-03-17 06:07:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:07:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:02,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:07:02,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:02,800 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:03,122 INFO L93 Difference]: Finished difference Result 347 states and 496 transitions. [2025-03-17 06:07:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:07:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:07:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:03,124 INFO L225 Difference]: With dead ends: 347 [2025-03-17 06:07:03,124 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 06:07:03,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:03,125 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 490 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:07:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 06:07:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 157. [2025-03-17 06:07:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 136 states have internal predecessors, (188), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 224 transitions. [2025-03-17 06:07:03,141 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 224 transitions. Word has length 92 [2025-03-17 06:07:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 224 transitions. [2025-03-17 06:07:03,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 224 transitions. [2025-03-17 06:07:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:03,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:03,144 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:07:03,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 458865157, now seen corresponding path program 1 times [2025-03-17 06:07:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299556455] [2025-03-17 06:07:03,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:03,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:03,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:03,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299556455] [2025-03-17 06:07:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299556455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:07:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039673869] [2025-03-17 06:07:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:07:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:07:04,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:07:04,633 INFO L87 Difference]: Start difference. First operand 157 states and 224 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:07:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:05,516 INFO L93 Difference]: Finished difference Result 396 states and 563 transitions. [2025-03-17 06:07:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:07:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-03-17 06:07:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:05,518 INFO L225 Difference]: With dead ends: 396 [2025-03-17 06:07:05,518 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 06:07:05,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:07:05,519 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 521 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:05,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 706 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:07:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 06:07:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 179. [2025-03-17 06:07:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 158 states have (on average 1.379746835443038) internal successors, (218), 158 states have internal predecessors, (218), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2025-03-17 06:07:05,533 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 93 [2025-03-17 06:07:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:05,533 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2025-03-17 06:07:05,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:07:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2025-03-17 06:07:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:05,534 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:05,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:07:05,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1785180054, now seen corresponding path program 1 times [2025-03-17 06:07:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129171896] [2025-03-17 06:07:05,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:05,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:05,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:05,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129171896] [2025-03-17 06:07:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129171896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:07:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326217542] [2025-03-17 06:07:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:07:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:05,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:07:05,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:05,698 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:05,716 INFO L93 Difference]: Finished difference Result 293 states and 417 transitions. [2025-03-17 06:07:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:07:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2025-03-17 06:07:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:05,719 INFO L225 Difference]: With dead ends: 293 [2025-03-17 06:07:05,719 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 06:07:05,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:05,720 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:05,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 06:07:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-17 06:07:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2025-03-17 06:07:05,735 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 93 [2025-03-17 06:07:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:05,735 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2025-03-17 06:07:05,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2025-03-17 06:07:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:05,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:05,737 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:05,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:07:05,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -914679398, now seen corresponding path program 1 times [2025-03-17 06:07:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980008168] [2025-03-17 06:07:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:05,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:05,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:05,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:05,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980008168] [2025-03-17 06:07:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980008168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:07:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128882187] [2025-03-17 06:07:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:06,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:07:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:06,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:07:06,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:06,152 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:07:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:06,742 INFO L93 Difference]: Finished difference Result 379 states and 534 transitions. [2025-03-17 06:07:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:07:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-03-17 06:07:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:06,745 INFO L225 Difference]: With dead ends: 379 [2025-03-17 06:07:06,745 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 06:07:06,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:07:06,745 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 167 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:06,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 489 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:07:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 06:07:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 185. [2025-03-17 06:07:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 164 states have internal predecessors, (221), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2025-03-17 06:07:06,764 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 93 [2025-03-17 06:07:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:06,764 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2025-03-17 06:07:06,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:07:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2025-03-17 06:07:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:06,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:06,765 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:06,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:07:06,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:06,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -883659591, now seen corresponding path program 1 times [2025-03-17 06:07:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332679993] [2025-03-17 06:07:06,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:06,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:06,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:06,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332679993] [2025-03-17 06:07:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332679993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:07:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23727748] [2025-03-17 06:07:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:07,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:07:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:07,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:07:07,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:07:07,784 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:09,052 INFO L93 Difference]: Finished difference Result 502 states and 696 transitions. [2025-03-17 06:07:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:07:09,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2025-03-17 06:07:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:09,055 INFO L225 Difference]: With dead ends: 502 [2025-03-17 06:07:09,055 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 06:07:09,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:07:09,057 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 493 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:09,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 765 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:07:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 06:07:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 204. [2025-03-17 06:07:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.349726775956284) internal successors, (247), 183 states have internal predecessors, (247), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-03-17 06:07:09,076 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 93 [2025-03-17 06:07:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:09,077 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-03-17 06:07:09,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2025-03-17 06:07:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:09,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:09,078 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:09,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:07:09,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1177062598, now seen corresponding path program 1 times [2025-03-17 06:07:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264816795] [2025-03-17 06:07:09,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:09,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:09,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:09,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264816795] [2025-03-17 06:07:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264816795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:07:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380844363] [2025-03-17 06:07:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:07:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:09,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:07:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:09,692 INFO L87 Difference]: Start difference. First operand 204 states and 283 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 06:07:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:10,070 INFO L93 Difference]: Finished difference Result 328 states and 460 transitions. [2025-03-17 06:07:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2025-03-17 06:07:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:10,074 INFO L225 Difference]: With dead ends: 328 [2025-03-17 06:07:10,074 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 06:07:10,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:07:10,075 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 167 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:10,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 381 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:07:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 06:07:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 188. [2025-03-17 06:07:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 167 states have (on average 1.341317365269461) internal successors, (224), 167 states have internal predecessors, (224), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2025-03-17 06:07:10,096 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 93 [2025-03-17 06:07:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:10,096 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2025-03-17 06:07:10,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 06:07:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2025-03-17 06:07:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 06:07:10,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:10,098 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:07:10,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:10,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1373251416, now seen corresponding path program 1 times [2025-03-17 06:07:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805208744] [2025-03-17 06:07:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 06:07:10,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 06:07:10,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:10,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:10,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805208744] [2025-03-17 06:07:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805208744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:07:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937671336] [2025-03-17 06:07:10,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:10,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:07:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:10,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:07:10,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:07:10,887 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 06:07:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:11,724 INFO L93 Difference]: Finished difference Result 371 states and 516 transitions. [2025-03-17 06:07:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:07:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2025-03-17 06:07:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:11,726 INFO L225 Difference]: With dead ends: 371 [2025-03-17 06:07:11,726 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 06:07:11,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:07:11,727 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 149 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:11,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 584 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 06:07:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2025-03-17 06:07:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2025-03-17 06:07:11,741 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 93 [2025-03-17 06:07:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:11,742 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2025-03-17 06:07:11,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 06:07:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2025-03-17 06:07:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 06:07:11,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:11,743 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:11,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:07:11,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 464870949, now seen corresponding path program 1 times [2025-03-17 06:07:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886587865] [2025-03-17 06:07:11,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:11,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 06:07:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 06:07:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886587865] [2025-03-17 06:07:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886587865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:07:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633958671] [2025-03-17 06:07:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:07:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:07:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:11,893 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:11,910 INFO L93 Difference]: Finished difference Result 288 states and 400 transitions. [2025-03-17 06:07:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:07:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 06:07:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:11,912 INFO L225 Difference]: With dead ends: 288 [2025-03-17 06:07:11,912 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 06:07:11,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:11,914 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:11,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 06:07:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2025-03-17 06:07:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 224 transitions. [2025-03-17 06:07:11,926 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 224 transitions. Word has length 94 [2025-03-17 06:07:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:11,928 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 224 transitions. [2025-03-17 06:07:11,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:07:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 224 transitions. [2025-03-17 06:07:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 06:07:11,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:11,929 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:11,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:07:11,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -397194362, now seen corresponding path program 1 times [2025-03-17 06:07:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353095333] [2025-03-17 06:07:11,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:11,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 06:07:11,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 06:07:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:07:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353095333] [2025-03-17 06:07:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353095333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:07:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103126329] [2025-03-17 06:07:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:13,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:07:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:13,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:07:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:07:13,330 INFO L87 Difference]: Start difference. First operand 163 states and 224 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 06:07:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:13,794 INFO L93 Difference]: Finished difference Result 306 states and 422 transitions. [2025-03-17 06:07:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2025-03-17 06:07:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:13,797 INFO L225 Difference]: With dead ends: 306 [2025-03-17 06:07:13,797 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 06:07:13,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:07:13,797 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 244 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:13,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 490 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:07:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 06:07:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 183. [2025-03-17 06:07:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2025-03-17 06:07:13,822 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 94 [2025-03-17 06:07:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2025-03-17 06:07:13,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 06:07:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2025-03-17 06:07:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 06:07:13,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:13,823 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:07:13,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2072162723, now seen corresponding path program 1 times [2025-03-17 06:07:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46519842] [2025-03-17 06:07:13,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:13,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 06:07:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 06:07:13,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:07:14,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46519842] [2025-03-17 06:07:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46519842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023075289] [2025-03-17 06:07:14,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:07:14,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:14,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:07:14,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:07:14,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 06:07:15,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 06:07:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:15,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 06:07:15,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:15,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-17 06:07:15,973 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-03-17 06:07:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:07:16,585 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 34 treesize of output 18 [2025-03-17 06:07:16,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2025-03-17 06:07:16,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:07:16,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:07:16,653 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2025-03-17 06:07:16,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 85 [2025-03-17 06:07:16,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:07:16,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:07:17,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:07:17,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 213 treesize of output 353 [2025-03-17 06:07:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 06:07:33,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:07:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023075289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:45,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:07:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2025-03-17 06:07:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681196475] [2025-03-17 06:07:45,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:07:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 06:07:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:45,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 06:07:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=956, Unknown=2, NotChecked=0, Total=1122 [2025-03-17 06:07:45,427 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 28 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 06:07:52,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:56,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:58,883 INFO L93 Difference]: Finished difference Result 374 states and 503 transitions. [2025-03-17 06:07:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:07:58,885 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 95 [2025-03-17 06:07:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:58,889 INFO L225 Difference]: With dead ends: 374 [2025-03-17 06:07:58,894 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 06:07:58,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=509, Invalid=2141, Unknown=2, NotChecked=0, Total=2652 [2025-03-17 06:07:58,897 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 323 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 126 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:58,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 846 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1449 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2025-03-17 06:07:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 06:07:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2025-03-17 06:07:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 181 states have internal predecessors, (236), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2025-03-17 06:07:58,997 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 95 [2025-03-17 06:07:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:59,001 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2025-03-17 06:07:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 06:07:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2025-03-17 06:07:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 06:07:59,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:59,004 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:07:59,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0