./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-s_file-70.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 fbc3d8d1a69e8bd3d6fe2e349933b2e0aa836a7f9d0aca281c4af875723b1f72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:42:55,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:42:55,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:42:55,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:42:55,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:42:55,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:42:55,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:42:55,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:42:55,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:42:55,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:42:55,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:42:55,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:42:55,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:42:55,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:42:55,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:42:55,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:42:55,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:42:55,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:42:55,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:42:55,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:42:55,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:42:55,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:42:55,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:42:55,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:42:55,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:42:55,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:42:55,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:42:55,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:42:55,111 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 -> fbc3d8d1a69e8bd3d6fe2e349933b2e0aa836a7f9d0aca281c4af875723b1f72 [2025-03-04 01:42:55,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:42:55,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:42:55,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:42:55,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:42:55,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:42:55,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i [2025-03-04 01:42:56,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8e1162f/dfbaf3d1ccea498d9087744c79cbd74c/FLAG8d312397b [2025-03-04 01:42:56,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:42:56,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i [2025-03-04 01:42:56,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8e1162f/dfbaf3d1ccea498d9087744c79cbd74c/FLAG8d312397b [2025-03-04 01:42:56,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8e1162f/dfbaf3d1ccea498d9087744c79cbd74c [2025-03-04 01:42:56,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:42:56,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:42:56,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:42:56,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:42:56,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:42:56,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56, skipping insertion in model container [2025-03-04 01:42:56,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:42:56,832 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-s_file-70.i[916,929] [2025-03-04 01:42:56,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:42:56,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:42:56,890 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-s_file-70.i[916,929] [2025-03-04 01:42:56,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:42:56,933 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:42:56,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56 WrapperNode [2025-03-04 01:42:56,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:42:56,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:42:56,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:42:56,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:42:56,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,974 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2025-03-04 01:42:56,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:42:56,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:42:56,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:42:56,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:42:56,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,991 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:42:56,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:56,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:42:57,020 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:42:57,020 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:42:57,020 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:42:57,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (1/1) ... [2025-03-04 01:42:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:42:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:57,047 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-04 01:42:57,050 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-04 01:42:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:42:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:42:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:42:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:42:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:42:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:42:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:42:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:42:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:42:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:42:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:42:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:42:57,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:42:57,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:42:57,570 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem88#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem113#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~bitwise111#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite137#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-04 01:42:57,603 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-04 01:42:57,603 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:42:57,615 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:42:57,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:42:57,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:42:57 BoogieIcfgContainer [2025-03-04 01:42:57,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:42:57,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:42:57,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:42:57,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:42:57,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:42:56" (1/3) ... [2025-03-04 01:42:57,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5689d22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:42:57, skipping insertion in model container [2025-03-04 01:42:57,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:56" (2/3) ... [2025-03-04 01:42:57,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5689d22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:42:57, skipping insertion in model container [2025-03-04 01:42:57,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:42:57" (3/3) ... [2025-03-04 01:42:57,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-70.i [2025-03-04 01:42:57,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:42:57,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-70.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:42:57,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:42:57,690 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;@421b3bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:42:57,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:42:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:42:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:42:57,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:57,711 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:42:57,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:57,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1482620245, now seen corresponding path program 1 times [2025-03-04 01:42:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169303329] [2025-03-04 01:42:57,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:57,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:57,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:57,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:57,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:42:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169303329] [2025-03-04 01:42:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169303329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920191638] [2025-03-04 01:42:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:58,024 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-04 01:42:58,026 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-04 01:42:58,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:58,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:58,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:58,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:58,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:42:58,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:42:58,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920191638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:42:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999815931] [2025-03-04 01:42:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:58,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:42:58,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:58,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:42:58,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:42:58,266 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:42:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:58,287 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2025-03-04 01:42:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:42:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-04 01:42:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:58,293 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:42:58,293 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:42:58,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:42:58,299 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:58,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:42:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:42:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:42:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-04 01:42:58,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2025-03-04 01:42:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-04 01:42:58,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:42:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-04 01:42:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:42:58,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:58,339 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:42:58,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:42:58,539 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-04 01:42:58,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 495039133, now seen corresponding path program 1 times [2025-03-04 01:42:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376557139] [2025-03-04 01:42:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:58,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:58,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:42:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376557139] [2025-03-04 01:42:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376557139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457730307] [2025-03-04 01:42:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:58,945 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-04 01:42:58,947 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-04 01:42:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:59,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:42:59,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:42:59,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457730307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:42:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006519572] [2025-03-04 01:42:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:42:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:59,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:42:59,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:59,138 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:42:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:59,176 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2025-03-04 01:42:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:42:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:42:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:59,178 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:42:59,178 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:42:59,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:59,179 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:59,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:42:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:42:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:42:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:42:59,186 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2025-03-04 01:42:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:42:59,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:42:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:42:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:42:59,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:59,189 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:42:59,196 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-04 01:42:59,390 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,SelfDestructingSolverStorable1 [2025-03-04 01:42:59,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1382542814, now seen corresponding path program 1 times [2025-03-04 01:42:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-03-04 01:42:59,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:59,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:59,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:42:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-03-04 01:42:59,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339616350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928346668] [2025-03-04 01:42:59,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:59,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:59,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:59,606 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-04 01:42:59,608 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-04 01:42:59,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:42:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:42:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:42:59,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:42:59,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928346668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:59,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:42:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688474837] [2025-03-04 01:42:59,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:59,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:42:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:59,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:42:59,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:59,804 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:42:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:59,841 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-03-04 01:42:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:42:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:42:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:59,843 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:42:59,843 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:42:59,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:59,844 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:59,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:42:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:42:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:42:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-04 01:42:59,852 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2025-03-04 01:42:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-04 01:42:59,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:42:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-04 01:42:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:42:59,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:59,857 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:42:59,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:43:00,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:00,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1383466335, now seen corresponding path program 1 times [2025-03-04 01:43:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287611545] [2025-03-04 01:43:00,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:00,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:43:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:43:00,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:43:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287611545] [2025-03-04 01:43:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287611545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579983552] [2025-03-04 01:43:00,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:00,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:00,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:43:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:43:00,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:43:00,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:00,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:43:00,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:00,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579983552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:43:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267047492] [2025-03-04 01:43:00,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:00,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:43:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:00,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:43:00,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:00,434 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:00,470 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2025-03-04 01:43:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:43:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:43:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:00,472 INFO L225 Difference]: With dead ends: 221 [2025-03-04 01:43:00,473 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:43:00,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:00,474 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:00,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:43:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 01:43:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-04 01:43:00,487 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 116 [2025-03-04 01:43:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-04 01:43:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-04 01:43:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:43:00,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:00,489 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:00,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2129589795, now seen corresponding path program 1 times [2025-03-04 01:43:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692915886] [2025-03-04 01:43:00,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:00,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:43:00,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:43:00,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692915886] [2025-03-04 01:43:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692915886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493782826] [2025-03-04 01:43:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:01,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:01,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:01,014 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:01,234 INFO L93 Difference]: Finished difference Result 282 states and 402 transitions. [2025-03-04 01:43:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:43:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:01,236 INFO L225 Difference]: With dead ends: 282 [2025-03-04 01:43:01,236 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 01:43:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:01,237 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:01,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 399 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 01:43:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2025-03-04 01:43:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-03-04 01:43:01,244 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2025-03-04 01:43:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:01,244 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-03-04 01:43:01,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-03-04 01:43:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:43:01,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:01,245 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:01,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:43:01,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:01,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2098569988, now seen corresponding path program 1 times [2025-03-04 01:43:01,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:01,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775188634] [2025-03-04 01:43:01,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:01,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:43:01,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:43:01,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775188634] [2025-03-04 01:43:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775188634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:01,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:01,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:43:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120658708] [2025-03-04 01:43:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:43:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:01,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:43:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:01,440 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:01,660 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2025-03-04 01:43:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:43:01,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:43:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:01,662 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:43:01,662 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:43:01,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:01,663 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:01,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 321 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:43:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:43:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2025-03-04 01:43:01,675 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2025-03-04 01:43:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2025-03-04 01:43:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2025-03-04 01:43:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:43:01,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:01,676 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:01,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:43:01,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:01,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1491694345, now seen corresponding path program 1 times [2025-03-04 01:43:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126691608] [2025-03-04 01:43:01,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:43:01,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:43:01,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126691608] [2025-03-04 01:43:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126691608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:43:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51574100] [2025-03-04 01:43:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:01,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:43:01,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:01,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:43:01,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:43:01,873 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:01,887 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2025-03-04 01:43:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:43:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-03-04 01:43:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:01,891 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:43:01,891 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:43:01,892 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-04 01:43:01,892 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:01,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:43:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:43:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2025-03-04 01:43:01,901 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 120 [2025-03-04 01:43:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:01,901 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2025-03-04 01:43:01,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2025-03-04 01:43:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:43:01,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:01,903 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:01,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:43:01,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1958801080, now seen corresponding path program 1 times [2025-03-04 01:43:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114619288] [2025-03-04 01:43:01,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:43:01,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:43:01,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114619288] [2025-03-04 01:43:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114619288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962387293] [2025-03-04 01:43:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:02,891 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:03,141 INFO L93 Difference]: Finished difference Result 281 states and 390 transitions. [2025-03-04 01:43:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:03,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-04 01:43:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:03,142 INFO L225 Difference]: With dead ends: 281 [2025-03-04 01:43:03,142 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 01:43:03,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:03,143 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 110 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:03,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 01:43:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2025-03-04 01:43:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2025-03-04 01:43:03,153 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 120 [2025-03-04 01:43:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:03,153 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2025-03-04 01:43:03,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2025-03-04 01:43:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:43:03,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:03,155 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:03,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:43:03,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:03,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2123335738, now seen corresponding path program 1 times [2025-03-04 01:43:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:03,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 01:43:03,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:03,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:03,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:43:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:43:03,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 01:43:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859775778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529652659] [2025-03-04 01:43:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:03,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:03,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:03,926 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:04,156 INFO L93 Difference]: Finished difference Result 297 states and 410 transitions. [2025-03-04 01:43:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:04,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:43:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:04,157 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:43:04,158 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:43:04,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:04,158 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 101 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:04,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 402 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:43:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2025-03-04 01:43:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2025-03-04 01:43:04,165 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 121 [2025-03-04 01:43:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:04,165 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2025-03-04 01:43:04,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2025-03-04 01:43:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:43:04,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:04,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:04,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:43:04,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:04,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1121342554, now seen corresponding path program 1 times [2025-03-04 01:43:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824111771] [2025-03-04 01:43:04,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:04,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:43:04,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:43:04,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:04,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:43:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824111771] [2025-03-04 01:43:04,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824111771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612594191] [2025-03-04 01:43:04,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:04,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:04,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:43:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:43:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:43:04,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:04,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:04,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:04,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:04,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612594191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:04,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:04,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:43:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865182822] [2025-03-04 01:43:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:04,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:04,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:04,488 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:04,524 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2025-03-04 01:43:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-03-04 01:43:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:04,525 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:43:04,526 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:43:04,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:04,527 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:04,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:43:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 01:43:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 124 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2025-03-04 01:43:04,533 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 121 [2025-03-04 01:43:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:04,533 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2025-03-04 01:43:04,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2025-03-04 01:43:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:43:04,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:04,535 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:04,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:04,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:43:04,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:04,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 705916347, now seen corresponding path program 1 times [2025-03-04 01:43:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157357830] [2025-03-04 01:43:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:04,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:43:04,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:43:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157357830] [2025-03-04 01:43:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157357830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:43:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326620762] [2025-03-04 01:43:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:43:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:05,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:43:05,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:43:05,996 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:07,567 INFO L93 Difference]: Finished difference Result 494 states and 680 transitions. [2025-03-04 01:43:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:43:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:43:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:07,569 INFO L225 Difference]: With dead ends: 494 [2025-03-04 01:43:07,569 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 01:43:07,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:43:07,570 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 349 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:07,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1741 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:43:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 01:43:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 158. [2025-03-04 01:43:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:43:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 216 transitions. [2025-03-04 01:43:07,579 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 216 transitions. Word has length 122 [2025-03-04 01:43:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:07,579 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 216 transitions. [2025-03-04 01:43:07,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 216 transitions. [2025-03-04 01:43:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:43:07,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:07,580 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:07,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:43:07,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash 195382170, now seen corresponding path program 1 times [2025-03-04 01:43:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528858902] [2025-03-04 01:43:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:07,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:43:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:43:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:07,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528858902] [2025-03-04 01:43:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528858902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590564106] [2025-03-04 01:43:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:08,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:08,212 INFO L87 Difference]: Start difference. First operand 158 states and 216 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:08,572 INFO L93 Difference]: Finished difference Result 378 states and 513 transitions. [2025-03-04 01:43:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:43:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:08,574 INFO L225 Difference]: With dead ends: 378 [2025-03-04 01:43:08,574 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 01:43:08,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:08,574 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 65 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:08,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 690 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 01:43:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2025-03-04 01:43:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 204 states have internal predecessors, (268), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 296 transitions. [2025-03-04 01:43:08,583 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 296 transitions. Word has length 122 [2025-03-04 01:43:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:08,583 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 296 transitions. [2025-03-04 01:43:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 296 transitions. [2025-03-04 01:43:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:43:08,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:08,584 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:08,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:43:08,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1056716284, now seen corresponding path program 1 times [2025-03-04 01:43:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:08,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019726383] [2025-03-04 01:43:08,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:08,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:43:08,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:43:08,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:08,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019726383] [2025-03-04 01:43:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019726383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086824914] [2025-03-04 01:43:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:09,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:09,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:09,194 INFO L87 Difference]: Start difference. First operand 220 states and 296 transitions. Second operand has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:43:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:09,630 INFO L93 Difference]: Finished difference Result 479 states and 641 transitions. [2025-03-04 01:43:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-04 01:43:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:09,633 INFO L225 Difference]: With dead ends: 479 [2025-03-04 01:43:09,633 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 01:43:09,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:09,634 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 67 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:09,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 689 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 01:43:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2025-03-04 01:43:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 193 states have (on average 1.310880829015544) internal successors, (253), 194 states have internal predecessors, (253), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 281 transitions. [2025-03-04 01:43:09,648 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 281 transitions. Word has length 122 [2025-03-04 01:43:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:09,648 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 281 transitions. [2025-03-04 01:43:09,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:43:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 281 transitions. [2025-03-04 01:43:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:43:09,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:09,649 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:09,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:43:09,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash 546182107, now seen corresponding path program 1 times [2025-03-04 01:43:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-03-04 01:43:09,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:43:09,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:43:09,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:09,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-03-04 01:43:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220062582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:43:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963354801] [2025-03-04 01:43:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:43:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:43:11,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:43:11,514 INFO L87 Difference]: Start difference. First operand 210 states and 281 transitions. Second operand has 17 states, 14 states have (on average 4.642857142857143) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:43:16,291 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 [] [2025-03-04 01:43:27,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:28,973 INFO L93 Difference]: Finished difference Result 542 states and 716 transitions. [2025-03-04 01:43:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:43:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.642857142857143) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2025-03-04 01:43:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:28,976 INFO L225 Difference]: With dead ends: 542 [2025-03-04 01:43:28,976 INFO L226 Difference]: Without dead ends: 335 [2025-03-04 01:43:28,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:43:28,977 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 325 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:28,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1615 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1422 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2025-03-04 01:43:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-04 01:43:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 219. [2025-03-04 01:43:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.311881188118812) internal successors, (265), 203 states have internal predecessors, (265), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 293 transitions. [2025-03-04 01:43:28,990 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 293 transitions. Word has length 122 [2025-03-04 01:43:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:28,991 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 293 transitions. [2025-03-04 01:43:28,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.642857142857143) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:43:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 293 transitions. [2025-03-04 01:43:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:43:28,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:28,994 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:43:28,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1986910499, now seen corresponding path program 1 times [2025-03-04 01:43:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049928988] [2025-03-04 01:43:28,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:29,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:43:29,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:43:29,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:29,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049928988] [2025-03-04 01:43:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049928988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:29,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201514338] [2025-03-04 01:43:29,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:29,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:29,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:29,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:29,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:29,129 INFO L87 Difference]: Start difference. First operand 219 states and 293 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:29,366 INFO L93 Difference]: Finished difference Result 472 states and 630 transitions. [2025-03-04 01:43:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:29,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:43:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:29,368 INFO L225 Difference]: With dead ends: 472 [2025-03-04 01:43:29,368 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 01:43:29,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:29,369 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 43 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:29,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 472 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 01:43:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2025-03-04 01:43:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 206 states have internal predecessors, (268), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 296 transitions. [2025-03-04 01:43:29,377 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 296 transitions. Word has length 123 [2025-03-04 01:43:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 296 transitions. [2025-03-04 01:43:29,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 296 transitions. [2025-03-04 01:43:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:43:29,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:29,379 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:29,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:43:29,379 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:29,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2097127949, now seen corresponding path program 1 times [2025-03-04 01:43:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48320222] [2025-03-04 01:43:29,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:29,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:43:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:43:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48320222] [2025-03-04 01:43:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48320222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850148306] [2025-03-04 01:43:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:29,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:29,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:29,596 INFO L87 Difference]: Start difference. First operand 222 states and 296 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:30,065 INFO L93 Difference]: Finished difference Result 600 states and 802 transitions. [2025-03-04 01:43:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:43:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:30,067 INFO L225 Difference]: With dead ends: 600 [2025-03-04 01:43:30,067 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 01:43:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:30,068 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 124 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:30,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 387 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 01:43:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 226. [2025-03-04 01:43:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 210 states have internal predecessors, (271), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2025-03-04 01:43:30,080 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 123 [2025-03-04 01:43:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:30,080 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2025-03-04 01:43:30,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2025-03-04 01:43:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:43:30,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:30,081 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:30,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:43:30,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash -564624712, now seen corresponding path program 1 times [2025-03-04 01:43:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141158815] [2025-03-04 01:43:30,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:30,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:43:30,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:43:30,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:30,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141158815] [2025-03-04 01:43:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141158815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429201624] [2025-03-04 01:43:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:30,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:30,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:30,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:30,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:30,289 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:30,802 INFO L93 Difference]: Finished difference Result 589 states and 783 transitions. [2025-03-04 01:43:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:43:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:30,805 INFO L225 Difference]: With dead ends: 589 [2025-03-04 01:43:30,805 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 01:43:30,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:30,807 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 120 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:30,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 452 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 01:43:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 225. [2025-03-04 01:43:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 209 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:43:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 295 transitions. [2025-03-04 01:43:30,818 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 295 transitions. Word has length 123 [2025-03-04 01:43:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:30,818 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 295 transitions. [2025-03-04 01:43:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:43:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 295 transitions. [2025-03-04 01:43:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:43:30,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:30,820 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:43:30,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 960986050, now seen corresponding path program 1 times [2025-03-04 01:43:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003842209] [2025-03-04 01:43:30,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:30,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:43:30,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:43:30,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:30,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:32,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003842209] [2025-03-04 01:43:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003842209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:43:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957229496] [2025-03-04 01:43:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:43:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:32,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:43:32,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:43:32,370 INFO L87 Difference]: Start difference. First operand 225 states and 295 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:34,833 INFO L93 Difference]: Finished difference Result 548 states and 723 transitions. [2025-03-04 01:43:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:43:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-04 01:43:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:34,835 INFO L225 Difference]: With dead ends: 548 [2025-03-04 01:43:34,835 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 01:43:34,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:43:34,835 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 120 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:34,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1474 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:43:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 01:43:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 310. [2025-03-04 01:43:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 279 states have (on average 1.2903225806451613) internal successors, (360), 281 states have internal predecessors, (360), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:43:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2025-03-04 01:43:34,858 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 124 [2025-03-04 01:43:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2025-03-04 01:43:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:43:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2025-03-04 01:43:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:43:34,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:34,859 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:43:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:43:34,860 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:34,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1733225054, now seen corresponding path program 1 times [2025-03-04 01:43:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103802588] [2025-03-04 01:43:34,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:34,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:43:34,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:43:34,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:34,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103802588] [2025-03-04 01:43:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103802588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:41,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851723474] [2025-03-04 01:43:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:41,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:41,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:41,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:41,523 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand has 13 states, 10 states have (on average 6.7) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:43:45,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:49,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:53,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:57,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:00,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:06,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:12,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:16,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:21,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:23,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:27,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:44:28,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []