./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:55:39,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:55:39,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:55:39,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:55:39,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:55:39,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:55:39,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:55:39,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:55:39,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:55:39,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:55:39,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:55:39,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:55:39,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:55:39,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:55:39,108 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:55:39,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:55:39,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:55:39,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:55:39,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:55:39,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:55:39,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:39,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:55:39,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:55:39,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:55:39,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:55:39,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:55:39,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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc [2025-02-06 03:55:39,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:55:39,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:55:39,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:55:39,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:55:39,364 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:55:39,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2025-02-06 03:55:40,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10254785/485aebac8ab74af2930d62eddad74f49/FLAG362277a3b [2025-02-06 03:55:40,792 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:55:40,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2025-02-06 03:55:40,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10254785/485aebac8ab74af2930d62eddad74f49/FLAG362277a3b [2025-02-06 03:55:41,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10254785/485aebac8ab74af2930d62eddad74f49 [2025-02-06 03:55:41,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:55:41,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:55:41,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:41,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:55:41,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:55:41,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a47042a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41, skipping insertion in model container [2025-02-06 03:55:41,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:55:41,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2025-02-06 03:55:41,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:41,271 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:55:41,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2025-02-06 03:55:41,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:41,319 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:55:41,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41 WrapperNode [2025-02-06 03:55:41,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:41,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:41,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:55:41,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:55:41,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,367 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-02-06 03:55:41,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:41,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:55:41,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:55:41,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:55:41,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,395 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-02-06 03:55:41,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:55:41,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:55:41,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:55:41,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:55:41,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (1/1) ... [2025-02-06 03:55:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:55:41,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:55:41,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:55:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:55:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 03:55:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 03:55:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:55:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:55:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:55:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:55:41,556 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:55:41,558 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:55:41,886 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-02-06 03:55:41,912 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-02-06 03:55:41,912 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:55:41,924 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:55:41,925 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:55:41,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:41 BoogieIcfgContainer [2025-02-06 03:55:41,926 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:55:41,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:55:41,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:55:41,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:55:41,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:55:41" (1/3) ... [2025-02-06 03:55:41,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:41, skipping insertion in model container [2025-02-06 03:55:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:41" (2/3) ... [2025-02-06 03:55:41,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:41, skipping insertion in model container [2025-02-06 03:55:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:41" (3/3) ... [2025-02-06 03:55:41,933 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-71.i [2025-02-06 03:55:41,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:55:41,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:55:41,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:55:41,996 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;@63ab1190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:55:41,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:55:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:55:42,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:42,008 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:42,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:42,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:42,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1033032455, now seen corresponding path program 1 times [2025-02-06 03:55:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231663937] [2025-02-06 03:55:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:42,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:55:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:55:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:42,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:55:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231663937] [2025-02-06 03:55:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231663937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:55:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478914728] [2025-02-06 03:55:42,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:55:42,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:55:42,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:55:42,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:55:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:55:42,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:55:42,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:42,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:42,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:55:42,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:55:42,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478914728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:55:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:55:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895835100] [2025-02-06 03:55:42,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:42,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:55:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:42,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:55:42,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:55:42,476 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:42,499 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-02-06 03:55:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:55:42,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-02-06 03:55:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:42,507 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:55:42,508 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:55:42,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:55:42,513 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:42,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:55:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:55:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-02-06 03:55:42,549 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-02-06 03:55:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:42,550 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-02-06 03:55:42,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-02-06 03:55:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:55:42,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:42,554 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:42,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:55:42,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:55:42,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:42,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash -611693478, now seen corresponding path program 1 times [2025-02-06 03:55:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:42,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755844321] [2025-02-06 03:55:42,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:42,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:55:42,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:55:42,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:42,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755844321] [2025-02-06 03:55:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755844321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:55:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483959789] [2025-02-06 03:55:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:43,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:55:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:43,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:55:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:43,128 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:43,154 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-02-06 03:55:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:55:43,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-02-06 03:55:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:43,156 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:55:43,156 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:55:43,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:43,157 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:55:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 03:55:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-02-06 03:55:43,166 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-02-06 03:55:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:43,168 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-02-06 03:55:43,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-02-06 03:55:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:55:43,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:43,169 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:43,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:55:43,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:43,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 275810203, now seen corresponding path program 1 times [2025-02-06 03:55:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231662221] [2025-02-06 03:55:43,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:55:43,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:55:43,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:43,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231662221] [2025-02-06 03:55:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231662221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:43,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:43,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:55:43,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235790380] [2025-02-06 03:55:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:43,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:55:43,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:43,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:55:43,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:43,379 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:43,412 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-02-06 03:55:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:55:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-02-06 03:55:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:43,413 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:55:43,413 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:55:43,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:43,416 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:43,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:55:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 03:55:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-02-06 03:55:43,429 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-02-06 03:55:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:43,429 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-02-06 03:55:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-02-06 03:55:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:55:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:43,433 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:43,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:55:43,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 276733724, now seen corresponding path program 1 times [2025-02-06 03:55:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733906071] [2025-02-06 03:55:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:43,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:55:43,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:55:43,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:43,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:44,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733906071] [2025-02-06 03:55:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733906071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:55:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59101952] [2025-02-06 03:55:44,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:44,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:44,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:44,263 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:44,660 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2025-02-06 03:55:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:55:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-02-06 03:55:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:44,662 INFO L225 Difference]: With dead ends: 290 [2025-02-06 03:55:44,664 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 03:55:44,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-02-06 03:55:44,665 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 107 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:44,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 537 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:55:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 03:55:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-02-06 03:55:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3125) internal successors, (189), 145 states have internal predecessors, (189), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:55:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 247 transitions. [2025-02-06 03:55:44,683 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 247 transitions. Word has length 144 [2025-02-06 03:55:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:44,683 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 247 transitions. [2025-02-06 03:55:44,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 247 transitions. [2025-02-06 03:55:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:55:44,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:44,686 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:44,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:55:44,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:44,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash 5282066, now seen corresponding path program 1 times [2025-02-06 03:55:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765834863] [2025-02-06 03:55:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:44,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:55:44,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:55:44,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:44,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765834863] [2025-02-06 03:55:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765834863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:55:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420459781] [2025-02-06 03:55:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:45,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:55:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:45,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:55:45,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:55:45,524 INFO L87 Difference]: Start difference. First operand 176 states and 247 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:45,982 INFO L93 Difference]: Finished difference Result 435 states and 613 transitions. [2025-02-06 03:55:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:55:45,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2025-02-06 03:55:45,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:45,985 INFO L225 Difference]: With dead ends: 435 [2025-02-06 03:55:45,985 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 03:55:45,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:55:45,987 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:45,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 669 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:55:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 03:55:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 185. [2025-02-06 03:55:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.326797385620915) internal successors, (203), 154 states have internal predecessors, (203), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:55:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2025-02-06 03:55:46,018 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 145 [2025-02-06 03:55:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:46,019 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2025-02-06 03:55:46,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2025-02-06 03:55:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:55:46,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:46,020 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:46,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:55:46,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash -446025639, now seen corresponding path program 1 times [2025-02-06 03:55:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537283462] [2025-02-06 03:55:46,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:55:46,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:55:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:46,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537283462] [2025-02-06 03:55:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537283462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:55:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007658024] [2025-02-06 03:55:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:46,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:55:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:46,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:55:46,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:55:46,964 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:47,293 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2025-02-06 03:55:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:55:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2025-02-06 03:55:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:47,297 INFO L225 Difference]: With dead ends: 425 [2025-02-06 03:55:47,297 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 03:55:47,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:55:47,298 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 74 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:47,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 870 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:55:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 03:55:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-02-06 03:55:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 203 states have internal predecessors, (264), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:55:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 334 transitions. [2025-02-06 03:55:47,314 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 334 transitions. Word has length 146 [2025-02-06 03:55:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:47,315 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 334 transitions. [2025-02-06 03:55:47,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 334 transitions. [2025-02-06 03:55:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:55:47,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:47,317 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:55:47,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1255867333, now seen corresponding path program 1 times [2025-02-06 03:55:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342963895] [2025-02-06 03:55:47,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:55:47,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:55:47,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342963895] [2025-02-06 03:55:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342963895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:55:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524169980] [2025-02-06 03:55:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:47,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:47,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:47,987 INFO L87 Difference]: Start difference. First operand 240 states and 334 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:48,185 INFO L93 Difference]: Finished difference Result 554 states and 770 transitions. [2025-02-06 03:55:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:55:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2025-02-06 03:55:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:48,187 INFO L225 Difference]: With dead ends: 554 [2025-02-06 03:55:48,187 INFO L226 Difference]: Without dead ends: 317 [2025-02-06 03:55:48,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-02-06 03:55:48,190 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:48,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 361 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:55:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-06 03:55:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2025-02-06 03:55:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 211 states have (on average 1.3127962085308056) internal successors, (277), 213 states have internal predecessors, (277), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:55:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2025-02-06 03:55:48,208 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 146 [2025-02-06 03:55:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:48,208 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2025-02-06 03:55:48,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2025-02-06 03:55:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:48,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:48,210 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:48,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:55:48,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:48,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 681936079, now seen corresponding path program 1 times [2025-02-06 03:55:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023362009] [2025-02-06 03:55:48,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:48,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:48,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:48,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:48,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023362009] [2025-02-06 03:55:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023362009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:55:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787304706] [2025-02-06 03:55:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:55:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:55:49,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:55:49,042 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:55:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:49,739 INFO L93 Difference]: Finished difference Result 629 states and 864 transitions. [2025-02-06 03:55:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:55:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2025-02-06 03:55:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:49,742 INFO L225 Difference]: With dead ends: 629 [2025-02-06 03:55:49,742 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 03:55:49,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:49,743 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 215 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:49,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 741 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:55:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 03:55:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 352. [2025-02-06 03:55:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 295 states have (on average 1.2949152542372881) internal successors, (382), 299 states have internal predecessors, (382), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 03:55:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2025-02-06 03:55:49,770 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 147 [2025-02-06 03:55:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2025-02-06 03:55:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:55:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2025-02-06 03:55:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:49,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:49,773 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:55:49,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1544609233, now seen corresponding path program 1 times [2025-02-06 03:55:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387348668] [2025-02-06 03:55:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:49,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:50,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387348668] [2025-02-06 03:55:50,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387348668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:50,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:50,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:55:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67623398] [2025-02-06 03:55:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:50,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:55:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:50,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:55:50,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:55:50,494 INFO L87 Difference]: Start difference. First operand 352 states and 484 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:50,777 INFO L93 Difference]: Finished difference Result 815 states and 1114 transitions. [2025-02-06 03:55:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:55:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-02-06 03:55:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:50,780 INFO L225 Difference]: With dead ends: 815 [2025-02-06 03:55:50,780 INFO L226 Difference]: Without dead ends: 466 [2025-02-06 03:55:50,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:50,785 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 900 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:55:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-06 03:55:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2025-02-06 03:55:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 395 states have (on average 1.2911392405063291) internal successors, (510), 401 states have internal predecessors, (510), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 03:55:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 628 transitions. [2025-02-06 03:55:50,813 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 628 transitions. Word has length 147 [2025-02-06 03:55:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:50,813 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 628 transitions. [2025-02-06 03:55:50,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 628 transitions. [2025-02-06 03:55:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:50,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:50,815 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:50,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:55:50,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -37057424, now seen corresponding path program 1 times [2025-02-06 03:55:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589367544] [2025-02-06 03:55:50,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:50,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589367544] [2025-02-06 03:55:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589367544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:55:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76380170] [2025-02-06 03:55:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:55:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:55:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:52,158 INFO L87 Difference]: Start difference. First operand 462 states and 628 transitions. Second operand has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-06 03:55:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:52,966 INFO L93 Difference]: Finished difference Result 1031 states and 1385 transitions. [2025-02-06 03:55:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:55:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 147 [2025-02-06 03:55:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:52,970 INFO L225 Difference]: With dead ends: 1031 [2025-02-06 03:55:52,970 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 03:55:52,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:55:52,971 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 142 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:52,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 965 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:55:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 03:55:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 493. [2025-02-06 03:55:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 421 states have (on average 1.2850356294536818) internal successors, (541), 428 states have internal predecessors, (541), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 03:55:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 663 transitions. [2025-02-06 03:55:53,007 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 663 transitions. Word has length 147 [2025-02-06 03:55:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:53,008 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 663 transitions. [2025-02-06 03:55:53,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-06 03:55:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 663 transitions. [2025-02-06 03:55:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:53,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:53,010 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:55:53,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -248408337, now seen corresponding path program 1 times [2025-02-06 03:55:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155566076] [2025-02-06 03:55:53,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:53,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:53,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155566076] [2025-02-06 03:55:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155566076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:55:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356054899] [2025-02-06 03:55:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:55:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:54,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:55:54,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:55:54,092 INFO L87 Difference]: Start difference. First operand 493 states and 663 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:54,648 INFO L93 Difference]: Finished difference Result 969 states and 1305 transitions. [2025-02-06 03:55:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:55:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-02-06 03:55:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:54,651 INFO L225 Difference]: With dead ends: 969 [2025-02-06 03:55:54,651 INFO L226 Difference]: Without dead ends: 488 [2025-02-06 03:55:54,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:54,653 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:54,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 852 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:55:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-06 03:55:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 471. [2025-02-06 03:55:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 406 states have internal predecessors, (510), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 03:55:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 632 transitions. [2025-02-06 03:55:54,682 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 632 transitions. Word has length 147 [2025-02-06 03:55:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 632 transitions. [2025-02-06 03:55:54,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 632 transitions. [2025-02-06 03:55:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:54,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:54,684 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:54,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:55:54,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 673148720, now seen corresponding path program 1 times [2025-02-06 03:55:54,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:54,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863945305] [2025-02-06 03:55:54,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:54,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:54,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:54,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863945305] [2025-02-06 03:55:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863945305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:55:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93692869] [2025-02-06 03:55:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:55:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:55,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:55:55,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:55:55,849 INFO L87 Difference]: Start difference. First operand 471 states and 632 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:56,398 INFO L93 Difference]: Finished difference Result 941 states and 1259 transitions. [2025-02-06 03:55:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:55:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-02-06 03:55:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:56,400 INFO L225 Difference]: With dead ends: 941 [2025-02-06 03:55:56,400 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 03:55:56,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:56,401 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:56,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 833 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:55:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 03:55:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 470. [2025-02-06 03:55:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 399 states have (on average 1.2731829573934836) internal successors, (508), 405 states have internal predecessors, (508), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 03:55:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 626 transitions. [2025-02-06 03:55:56,426 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 626 transitions. Word has length 147 [2025-02-06 03:55:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:56,426 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 626 transitions. [2025-02-06 03:55:56,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 626 transitions. [2025-02-06 03:55:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:55:56,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:56,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:55:56,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:56,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2114266767, now seen corresponding path program 1 times [2025-02-06 03:55:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712221656] [2025-02-06 03:55:56,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:56,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:55:56,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:55:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:56,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712221656] [2025-02-06 03:55:56,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712221656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:56,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:55:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846894446] [2025-02-06 03:55:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:56,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:55:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:56,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:55:56,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:55:56,637 INFO L87 Difference]: Start difference. First operand 470 states and 626 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:56,891 INFO L93 Difference]: Finished difference Result 1021 states and 1358 transitions. [2025-02-06 03:55:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:55:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-02-06 03:55:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:56,894 INFO L225 Difference]: With dead ends: 1021 [2025-02-06 03:55:56,894 INFO L226 Difference]: Without dead ends: 554 [2025-02-06 03:55:56,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:55:56,896 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 104 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:56,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1092 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:55:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-06 03:55:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 541. [2025-02-06 03:55:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 440 states have (on average 1.2431818181818182) internal successors, (547), 447 states have internal predecessors, (547), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:55:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 715 transitions. [2025-02-06 03:55:56,924 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 715 transitions. Word has length 147 [2025-02-06 03:55:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:56,925 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 715 transitions. [2025-02-06 03:55:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 715 transitions. [2025-02-06 03:55:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:55:56,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:56,927 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:56,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:55:56,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1460447311, now seen corresponding path program 1 times [2025-02-06 03:55:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494268871] [2025-02-06 03:55:56,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:56,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:55:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:55:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494268871] [2025-02-06 03:55:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494268871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:55:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604972666] [2025-02-06 03:55:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:58,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:55:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:58,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:55:58,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:58,062 INFO L87 Difference]: Start difference. First operand 541 states and 715 transitions. Second operand has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:58,834 INFO L93 Difference]: Finished difference Result 1186 states and 1574 transitions. [2025-02-06 03:55:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:55:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2025-02-06 03:55:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:58,837 INFO L225 Difference]: With dead ends: 1186 [2025-02-06 03:55:58,837 INFO L226 Difference]: Without dead ends: 661 [2025-02-06 03:55:58,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:55:58,839 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:58,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 880 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:55:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-06 03:55:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2025-02-06 03:55:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 550 states have (on average 1.2672727272727273) internal successors, (697), 559 states have internal predecessors, (697), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 03:55:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 873 transitions. [2025-02-06 03:55:58,873 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 873 transitions. Word has length 148 [2025-02-06 03:55:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:58,873 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 873 transitions. [2025-02-06 03:55:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:55:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 873 transitions. [2025-02-06 03:55:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:55:58,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:58,875 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:58,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:55:58,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:58,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 949913134, now seen corresponding path program 1 times [2025-02-06 03:55:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:55:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813585812] [2025-02-06 03:55:58,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:55:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:55:58,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:55:58,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:58,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:55:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813585812] [2025-02-06 03:55:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813585812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:59,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:59,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:55:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455647190] [2025-02-06 03:55:59,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:59,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:55:59,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:55:59,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:55:59,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:55:59,612 INFO L87 Difference]: Start difference. First operand 657 states and 873 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:00,421 INFO L93 Difference]: Finished difference Result 1554 states and 2076 transitions. [2025-02-06 03:56:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:56:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-02-06 03:56:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:00,425 INFO L225 Difference]: With dead ends: 1554 [2025-02-06 03:56:00,426 INFO L226 Difference]: Without dead ends: 913 [2025-02-06 03:56:00,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:56:00,429 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 86 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:00,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1160 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:56:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-02-06 03:56:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 857. [2025-02-06 03:56:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 737 states have (on average 1.2890094979647218) internal successors, (950), 749 states have internal predecessors, (950), 98 states have call successors, (98), 21 states have call predecessors, (98), 21 states have return successors, (98), 86 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-06 03:56:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1146 transitions. [2025-02-06 03:56:00,465 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1146 transitions. Word has length 148 [2025-02-06 03:56:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:00,466 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1146 transitions. [2025-02-06 03:56:00,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1146 transitions. [2025-02-06 03:56:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:56:00,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:00,468 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:56:00,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1457907827, now seen corresponding path program 1 times [2025-02-06 03:56:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015457403] [2025-02-06 03:56:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:00,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:56:00,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:56:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015457403] [2025-02-06 03:56:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015457403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877328955] [2025-02-06 03:56:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:00,588 INFO L87 Difference]: Start difference. First operand 857 states and 1146 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:00,766 INFO L93 Difference]: Finished difference Result 1931 states and 2576 transitions. [2025-02-06 03:56:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-02-06 03:56:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:00,771 INFO L225 Difference]: With dead ends: 1931 [2025-02-06 03:56:00,771 INFO L226 Difference]: Without dead ends: 1090 [2025-02-06 03:56:00,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:00,773 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 100 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:00,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 359 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-02-06 03:56:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 939. [2025-02-06 03:56:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 802 states have (on average 1.2793017456359101) internal successors, (1026), 815 states have internal predecessors, (1026), 112 states have call successors, (112), 24 states have call predecessors, (112), 24 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1250 transitions. [2025-02-06 03:56:00,837 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1250 transitions. Word has length 148 [2025-02-06 03:56:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:00,838 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1250 transitions. [2025-02-06 03:56:00,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1250 transitions. [2025-02-06 03:56:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:56:00,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:00,840 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:00,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:56:00,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:00,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1459616842, now seen corresponding path program 1 times [2025-02-06 03:56:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735670204] [2025-02-06 03:56:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:56:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:56:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735670204] [2025-02-06 03:56:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735670204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:01,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:01,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690325708] [2025-02-06 03:56:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:01,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:01,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:01,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:01,242 INFO L87 Difference]: Start difference. First operand 939 states and 1250 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:01,556 INFO L93 Difference]: Finished difference Result 1911 states and 2544 transitions. [2025-02-06 03:56:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-02-06 03:56:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:01,561 INFO L225 Difference]: With dead ends: 1911 [2025-02-06 03:56:01,561 INFO L226 Difference]: Without dead ends: 1000 [2025-02-06 03:56:01,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-02-06 03:56:01,563 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 90 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:01,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 414 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-02-06 03:56:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 946. [2025-02-06 03:56:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 809 states have (on average 1.2793572311495673) internal successors, (1035), 822 states have internal predecessors, (1035), 112 states have call successors, (112), 24 states have call predecessors, (112), 24 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1259 transitions. [2025-02-06 03:56:01,615 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1259 transitions. Word has length 148 [2025-02-06 03:56:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:01,615 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1259 transitions. [2025-02-06 03:56:01,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1259 transitions. [2025-02-06 03:56:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:56:01,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:01,618 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:01,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:56:01,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:01,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash -106307145, now seen corresponding path program 1 times [2025-02-06 03:56:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:01,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715293057] [2025-02-06 03:56:01,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:01,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:56:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:56:01,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:01,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:02,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715293057] [2025-02-06 03:56:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715293057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464784031] [2025-02-06 03:56:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:02,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:02,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:02,002 INFO L87 Difference]: Start difference. First operand 946 states and 1259 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:02,356 INFO L93 Difference]: Finished difference Result 1864 states and 2479 transitions. [2025-02-06 03:56:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-02-06 03:56:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:02,360 INFO L225 Difference]: With dead ends: 1864 [2025-02-06 03:56:02,360 INFO L226 Difference]: Without dead ends: 946 [2025-02-06 03:56:02,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-02-06 03:56:02,362 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 60 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:02,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 606 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-02-06 03:56:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 943. [2025-02-06 03:56:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 805 states have (on average 1.2757763975155278) internal successors, (1027), 818 states have internal predecessors, (1027), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1251 transitions. [2025-02-06 03:56:02,396 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1251 transitions. Word has length 148 [2025-02-06 03:56:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:02,398 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1251 transitions. [2025-02-06 03:56:02,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1251 transitions. [2025-02-06 03:56:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:56:02,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:02,399 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:56:02,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1566019195, now seen corresponding path program 1 times [2025-02-06 03:56:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302913286] [2025-02-06 03:56:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:02,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:56:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:56:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:02,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:02,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302913286] [2025-02-06 03:56:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302913286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:02,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347381242] [2025-02-06 03:56:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:02,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:02,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:02,923 INFO L87 Difference]: Start difference. First operand 943 states and 1251 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:03,201 INFO L93 Difference]: Finished difference Result 1800 states and 2385 transitions. [2025-02-06 03:56:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-02-06 03:56:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:03,206 INFO L225 Difference]: With dead ends: 1800 [2025-02-06 03:56:03,206 INFO L226 Difference]: Without dead ends: 885 [2025-02-06 03:56:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-02-06 03:56:03,208 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 51 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 557 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-06 03:56:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2025-02-06 03:56:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 745 states have (on average 1.25503355704698) internal successors, (935), 758 states have internal predecessors, (935), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1159 transitions. [2025-02-06 03:56:03,241 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1159 transitions. Word has length 149 [2025-02-06 03:56:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1159 transitions. [2025-02-06 03:56:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1159 transitions. [2025-02-06 03:56:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:56:03,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:03,243 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:56:03,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2013938487, now seen corresponding path program 1 times [2025-02-06 03:56:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139901608] [2025-02-06 03:56:03,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:03,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:56:03,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:56:03,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:03,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139901608] [2025-02-06 03:56:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139901608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:56:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340184391] [2025-02-06 03:56:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:56:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:04,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:56:04,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:04,841 INFO L87 Difference]: Start difference. First operand 883 states and 1159 transitions. Second operand has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:05,646 INFO L93 Difference]: Finished difference Result 1791 states and 2347 transitions. [2025-02-06 03:56:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:56:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-02-06 03:56:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:05,655 INFO L225 Difference]: With dead ends: 1791 [2025-02-06 03:56:05,655 INFO L226 Difference]: Without dead ends: 936 [2025-02-06 03:56:05,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:56:05,661 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 203 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:05,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1157 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:56:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-06 03:56:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 898. [2025-02-06 03:56:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 760 states have (on average 1.2552631578947369) internal successors, (954), 773 states have internal predecessors, (954), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1178 transitions. [2025-02-06 03:56:05,730 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1178 transitions. Word has length 149 [2025-02-06 03:56:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1178 transitions. [2025-02-06 03:56:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1178 transitions. [2025-02-06 03:56:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:56:05,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:05,735 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:56:05,735 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1036264328, now seen corresponding path program 1 times [2025-02-06 03:56:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173095896] [2025-02-06 03:56:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:56:05,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:56:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173095896] [2025-02-06 03:56:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173095896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:06,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:56:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311256904] [2025-02-06 03:56:06,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:06,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:56:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:06,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:56:06,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:06,665 INFO L87 Difference]: Start difference. First operand 898 states and 1178 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:07,055 INFO L93 Difference]: Finished difference Result 1796 states and 2353 transitions. [2025-02-06 03:56:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-02-06 03:56:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:07,059 INFO L225 Difference]: With dead ends: 1796 [2025-02-06 03:56:07,059 INFO L226 Difference]: Without dead ends: 926 [2025-02-06 03:56:07,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:56:07,061 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:07,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 795 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-06 03:56:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 822. [2025-02-06 03:56:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 688 states have (on average 1.244186046511628) internal successors, (856), 699 states have internal predecessors, (856), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1072 transitions. [2025-02-06 03:56:07,116 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1072 transitions. Word has length 149 [2025-02-06 03:56:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1072 transitions. [2025-02-06 03:56:07,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1072 transitions. [2025-02-06 03:56:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:07,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:07,118 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:07,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:56:07,118 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1803376148, now seen corresponding path program 1 times [2025-02-06 03:56:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644332953] [2025-02-06 03:56:07,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:07,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:07,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:07,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:07,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644332953] [2025-02-06 03:56:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644332953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137488938] [2025-02-06 03:56:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:07,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:07,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:07,492 INFO L87 Difference]: Start difference. First operand 822 states and 1072 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:07,747 INFO L93 Difference]: Finished difference Result 1709 states and 2226 transitions. [2025-02-06 03:56:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-02-06 03:56:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:07,751 INFO L225 Difference]: With dead ends: 1709 [2025-02-06 03:56:07,751 INFO L226 Difference]: Without dead ends: 915 [2025-02-06 03:56:07,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-02-06 03:56:07,754 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 65 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:07,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 501 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-02-06 03:56:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 822. [2025-02-06 03:56:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 688 states have (on average 1.242732558139535) internal successors, (855), 699 states have internal predecessors, (855), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1071 transitions. [2025-02-06 03:56:07,787 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1071 transitions. Word has length 150 [2025-02-06 03:56:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1071 transitions. [2025-02-06 03:56:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1071 transitions. [2025-02-06 03:56:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:07,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:07,789 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:56:07,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1772356341, now seen corresponding path program 1 times [2025-02-06 03:56:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992042804] [2025-02-06 03:56:07,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:07,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:07,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:07,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:08,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:08,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992042804] [2025-02-06 03:56:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992042804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:56:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033933734] [2025-02-06 03:56:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:08,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:56:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:08,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:56:08,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:08,204 INFO L87 Difference]: Start difference. First operand 822 states and 1071 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:08,576 INFO L93 Difference]: Finished difference Result 1690 states and 2198 transitions. [2025-02-06 03:56:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-02-06 03:56:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:08,580 INFO L225 Difference]: With dead ends: 1690 [2025-02-06 03:56:08,581 INFO L226 Difference]: Without dead ends: 896 [2025-02-06 03:56:08,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:56:08,582 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:08,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 824 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-02-06 03:56:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 826. [2025-02-06 03:56:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 689 states have (on average 1.2409288824383164) internal successors, (855), 700 states have internal predecessors, (855), 110 states have call successors, (110), 26 states have call predecessors, (110), 26 states have return successors, (110), 99 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 03:56:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1075 transitions. [2025-02-06 03:56:08,616 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1075 transitions. Word has length 150 [2025-02-06 03:56:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1075 transitions. [2025-02-06 03:56:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1075 transitions. [2025-02-06 03:56:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:08,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:08,618 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:56:08,619 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1955179441, now seen corresponding path program 1 times [2025-02-06 03:56:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798298242] [2025-02-06 03:56:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:08,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:08,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:08,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:08,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798298242] [2025-02-06 03:56:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798298242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636625065] [2025-02-06 03:56:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:09,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:09,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:09,399 INFO L87 Difference]: Start difference. First operand 826 states and 1075 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:09,802 INFO L93 Difference]: Finished difference Result 1675 states and 2180 transitions. [2025-02-06 03:56:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:56:09,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-02-06 03:56:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:09,806 INFO L225 Difference]: With dead ends: 1675 [2025-02-06 03:56:09,806 INFO L226 Difference]: Without dead ends: 873 [2025-02-06 03:56:09,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:09,807 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:09,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 588 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-06 03:56:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824. [2025-02-06 03:56:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 687 states have (on average 1.2358078602620088) internal successors, (849), 698 states have internal predecessors, (849), 110 states have call successors, (110), 26 states have call predecessors, (110), 26 states have return successors, (110), 99 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 03:56:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1069 transitions. [2025-02-06 03:56:09,841 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1069 transitions. Word has length 150 [2025-02-06 03:56:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:09,841 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1069 transitions. [2025-02-06 03:56:09,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1069 transitions. [2025-02-06 03:56:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:09,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:09,842 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:56:09,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:09,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 958107088, now seen corresponding path program 1 times [2025-02-06 03:56:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996224653] [2025-02-06 03:56:09,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:09,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:09,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:10,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996224653] [2025-02-06 03:56:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996224653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:10,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:10,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:56:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415256215] [2025-02-06 03:56:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:10,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:56:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:10,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:56:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:10,395 INFO L87 Difference]: Start difference. First operand 824 states and 1069 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:10,847 INFO L93 Difference]: Finished difference Result 1687 states and 2186 transitions. [2025-02-06 03:56:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-02-06 03:56:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:10,855 INFO L225 Difference]: With dead ends: 1687 [2025-02-06 03:56:10,855 INFO L226 Difference]: Without dead ends: 887 [2025-02-06 03:56:10,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:56:10,857 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 60 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:10,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 971 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-06 03:56:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 789. [2025-02-06 03:56:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 655 states have (on average 1.2305343511450382) internal successors, (806), 665 states have internal predecessors, (806), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 98 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1022 transitions. [2025-02-06 03:56:10,894 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1022 transitions. Word has length 150 [2025-02-06 03:56:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:10,895 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1022 transitions. [2025-02-06 03:56:10,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1022 transitions. [2025-02-06 03:56:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:10,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:10,897 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:10,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:56:10,898 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:10,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1985943668, now seen corresponding path program 1 times [2025-02-06 03:56:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288871848] [2025-02-06 03:56:10,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:10,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:10,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:10,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288871848] [2025-02-06 03:56:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288871848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:56:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979637447] [2025-02-06 03:56:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:56:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:13,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:56:13,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:56:13,005 INFO L87 Difference]: Start difference. First operand 789 states and 1022 transitions. Second operand has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-06 03:56:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:14,264 INFO L93 Difference]: Finished difference Result 1657 states and 2146 transitions. [2025-02-06 03:56:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:56:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 150 [2025-02-06 03:56:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:14,272 INFO L225 Difference]: With dead ends: 1657 [2025-02-06 03:56:14,272 INFO L226 Difference]: Without dead ends: 892 [2025-02-06 03:56:14,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:56:14,275 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 113 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1263 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:56:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-06 03:56:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 805. [2025-02-06 03:56:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 670 states have (on average 1.2313432835820894) internal successors, (825), 680 states have internal predecessors, (825), 108 states have call successors, (108), 26 states have call predecessors, (108), 26 states have return successors, (108), 98 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1041 transitions. [2025-02-06 03:56:14,457 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1041 transitions. Word has length 150 [2025-02-06 03:56:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:14,458 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1041 transitions. [2025-02-06 03:56:14,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-06 03:56:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1041 transitions. [2025-02-06 03:56:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:14,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:14,467 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:56:14,470 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:14,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1798489451, now seen corresponding path program 1 times [2025-02-06 03:56:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907586117] [2025-02-06 03:56:14,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:14,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907586117] [2025-02-06 03:56:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907586117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:15,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:15,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774829731] [2025-02-06 03:56:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:15,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:15,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:15,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:15,612 INFO L87 Difference]: Start difference. First operand 805 states and 1041 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:16,065 INFO L93 Difference]: Finished difference Result 1636 states and 2113 transitions. [2025-02-06 03:56:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:56:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-02-06 03:56:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:16,070 INFO L225 Difference]: With dead ends: 1636 [2025-02-06 03:56:16,070 INFO L226 Difference]: Without dead ends: 855 [2025-02-06 03:56:16,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:16,073 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:16,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 735 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-06 03:56:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 757. [2025-02-06 03:56:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 629 states have (on average 1.2209856915739268) internal successors, (768), 638 states have internal predecessors, (768), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 972 transitions. [2025-02-06 03:56:16,159 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 972 transitions. Word has length 150 [2025-02-06 03:56:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:16,159 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 972 transitions. [2025-02-06 03:56:16,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 972 transitions. [2025-02-06 03:56:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:16,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:16,161 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:16,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:56:16,162 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:16,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1577119443, now seen corresponding path program 1 times [2025-02-06 03:56:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996981303] [2025-02-06 03:56:16,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:16,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:16,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:16,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:16,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996981303] [2025-02-06 03:56:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996981303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:18,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:56:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645545743] [2025-02-06 03:56:18,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:18,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:56:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:18,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:56:18,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:18,005 INFO L87 Difference]: Start difference. First operand 757 states and 972 transitions. Second operand has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:19,067 INFO L93 Difference]: Finished difference Result 1492 states and 1917 transitions. [2025-02-06 03:56:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:56:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:56:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:19,075 INFO L225 Difference]: With dead ends: 1492 [2025-02-06 03:56:19,075 INFO L226 Difference]: Without dead ends: 759 [2025-02-06 03:56:19,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:56:19,078 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 55 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:19,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1297 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:56:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-06 03:56:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 745. [2025-02-06 03:56:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 617 states have (on average 1.2188006482982172) internal successors, (752), 626 states have internal predecessors, (752), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 956 transitions. [2025-02-06 03:56:19,123 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 956 transitions. Word has length 150 [2025-02-06 03:56:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:19,126 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 956 transitions. [2025-02-06 03:56:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 956 transitions. [2025-02-06 03:56:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:19,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:19,130 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:56:19,131 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:19,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1262077744, now seen corresponding path program 1 times [2025-02-06 03:56:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090146608] [2025-02-06 03:56:19,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:19,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:19,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:19,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:19,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090146608] [2025-02-06 03:56:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090146608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:56:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760096645] [2025-02-06 03:56:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:56:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:20,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:56:20,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:56:20,639 INFO L87 Difference]: Start difference. First operand 745 states and 956 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:21,682 INFO L93 Difference]: Finished difference Result 1644 states and 2106 transitions. [2025-02-06 03:56:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:56:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:56:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:21,686 INFO L225 Difference]: With dead ends: 1644 [2025-02-06 03:56:21,688 INFO L226 Difference]: Without dead ends: 923 [2025-02-06 03:56:21,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:56:21,694 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 134 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:21,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1324 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:56:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-06 03:56:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 755. [2025-02-06 03:56:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 627 states have (on average 1.2216905901116428) internal successors, (766), 636 states have internal predecessors, (766), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 970 transitions. [2025-02-06 03:56:21,733 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 970 transitions. Word has length 150 [2025-02-06 03:56:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:21,734 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 970 transitions. [2025-02-06 03:56:21,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 970 transitions. [2025-02-06 03:56:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:21,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:21,737 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:21,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:56:21,737 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -994833263, now seen corresponding path program 1 times [2025-02-06 03:56:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134152397] [2025-02-06 03:56:21,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:21,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:21,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134152397] [2025-02-06 03:56:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134152397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:56:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887029904] [2025-02-06 03:56:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:23,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:56:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:23,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:56:23,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:56:23,362 INFO L87 Difference]: Start difference. First operand 755 states and 970 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:24,445 INFO L93 Difference]: Finished difference Result 1666 states and 2134 transitions. [2025-02-06 03:56:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:56:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:56:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:24,449 INFO L225 Difference]: With dead ends: 1666 [2025-02-06 03:56:24,449 INFO L226 Difference]: Without dead ends: 935 [2025-02-06 03:56:24,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:56:24,451 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 105 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:24,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1340 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:56:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-06 03:56:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 755. [2025-02-06 03:56:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 627 states have (on average 1.2216905901116428) internal successors, (766), 636 states have internal predecessors, (766), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 970 transitions. [2025-02-06 03:56:24,486 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 970 transitions. Word has length 150 [2025-02-06 03:56:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 970 transitions. [2025-02-06 03:56:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 970 transitions. [2025-02-06 03:56:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:56:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:24,488 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:56:24,488 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 297516278, now seen corresponding path program 1 times [2025-02-06 03:56:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711546131] [2025-02-06 03:56:24,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:24,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:56:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:56:24,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:24,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711546131] [2025-02-06 03:56:25,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711546131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:25,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:25,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:56:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948496597] [2025-02-06 03:56:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:25,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:56:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:25,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:56:25,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:25,346 INFO L87 Difference]: Start difference. First operand 755 states and 970 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:25,992 INFO L93 Difference]: Finished difference Result 1487 states and 1912 transitions. [2025-02-06 03:56:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:56:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-02-06 03:56:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:25,995 INFO L225 Difference]: With dead ends: 1487 [2025-02-06 03:56:25,995 INFO L226 Difference]: Without dead ends: 756 [2025-02-06 03:56:25,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:56:25,997 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 54 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:25,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1313 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-02-06 03:56:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 753. [2025-02-06 03:56:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 625 states have (on average 1.2208) internal successors, (763), 634 states have internal predecessors, (763), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 967 transitions. [2025-02-06 03:56:26,052 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 967 transitions. Word has length 150 [2025-02-06 03:56:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 967 transitions. [2025-02-06 03:56:26,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 967 transitions. [2025-02-06 03:56:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:26,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:26,054 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:26,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:56:26,054 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:26,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:26,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1810200001, now seen corresponding path program 1 times [2025-02-06 03:56:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:26,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855205142] [2025-02-06 03:56:26,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:26,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:26,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:26,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:26,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855205142] [2025-02-06 03:56:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855205142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:56:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040428544] [2025-02-06 03:56:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:56:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:27,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:56:27,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:56:27,626 INFO L87 Difference]: Start difference. First operand 753 states and 967 transitions. Second operand has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:28,257 INFO L93 Difference]: Finished difference Result 1557 states and 1998 transitions. [2025-02-06 03:56:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:56:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2025-02-06 03:56:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:28,261 INFO L225 Difference]: With dead ends: 1557 [2025-02-06 03:56:28,261 INFO L226 Difference]: Without dead ends: 828 [2025-02-06 03:56:28,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:56:28,262 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 53 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 982 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-06 03:56:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 739. [2025-02-06 03:56:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 611 states have (on average 1.2160392798690671) internal successors, (743), 620 states have internal predecessors, (743), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:56:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2025-02-06 03:56:28,338 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 151 [2025-02-06 03:56:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:28,338 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2025-02-06 03:56:28,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2025-02-06 03:56:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:28,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:28,339 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:28,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:56:28,339 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:28,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash 770630599, now seen corresponding path program 1 times [2025-02-06 03:56:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:28,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885263041] [2025-02-06 03:56:28,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:28,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:28,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:28,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:28,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885263041] [2025-02-06 03:56:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885263041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:28,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395271317] [2025-02-06 03:56:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:28,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:28,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:28,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:28,752 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:29,145 INFO L93 Difference]: Finished difference Result 1466 states and 1875 transitions. [2025-02-06 03:56:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-02-06 03:56:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:29,149 INFO L225 Difference]: With dead ends: 1466 [2025-02-06 03:56:29,149 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 03:56:29,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:29,152 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 150 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:29,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 518 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 03:56:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 517. [2025-02-06 03:56:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 444 states have (on average 1.2252252252252251) internal successors, (544), 449 states have internal predecessors, (544), 57 states have call successors, (57), 15 states have call predecessors, (57), 15 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:56:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 658 transitions. [2025-02-06 03:56:29,180 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 658 transitions. Word has length 151 [2025-02-06 03:56:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 658 transitions. [2025-02-06 03:56:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 658 transitions. [2025-02-06 03:56:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:29,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:29,181 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:56:29,181 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:29,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1042797516, now seen corresponding path program 1 times [2025-02-06 03:56:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373898104] [2025-02-06 03:56:29,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:29,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:29,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:29,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:29,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373898104] [2025-02-06 03:56:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373898104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419324988] [2025-02-06 03:56:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:29,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:29,298 INFO L87 Difference]: Start difference. First operand 517 states and 658 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:29,467 INFO L93 Difference]: Finished difference Result 1133 states and 1437 transitions. [2025-02-06 03:56:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:29,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-02-06 03:56:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:29,470 INFO L225 Difference]: With dead ends: 1133 [2025-02-06 03:56:29,470 INFO L226 Difference]: Without dead ends: 640 [2025-02-06 03:56:29,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:29,472 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 403 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-06 03:56:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 578. [2025-02-06 03:56:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 494 states have (on average 1.214574898785425) internal successors, (600), 500 states have internal predecessors, (600), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:56:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 730 transitions. [2025-02-06 03:56:29,502 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 730 transitions. Word has length 151 [2025-02-06 03:56:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 730 transitions. [2025-02-06 03:56:29,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 730 transitions. [2025-02-06 03:56:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:29,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:29,504 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:29,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:56:29,504 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:29,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1254148429, now seen corresponding path program 1 times [2025-02-06 03:56:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445246492] [2025-02-06 03:56:29,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:29,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445246492] [2025-02-06 03:56:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445246492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496055941] [2025-02-06 03:56:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:29,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:29,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:29,858 INFO L87 Difference]: Start difference. First operand 578 states and 730 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:30,270 INFO L93 Difference]: Finished difference Result 1315 states and 1664 transitions. [2025-02-06 03:56:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-02-06 03:56:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:30,273 INFO L225 Difference]: With dead ends: 1315 [2025-02-06 03:56:30,273 INFO L226 Difference]: Without dead ends: 761 [2025-02-06 03:56:30,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:30,274 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 93 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:30,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 579 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-06 03:56:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 571. [2025-02-06 03:56:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 487 states have (on average 1.2094455852156059) internal successors, (589), 493 states have internal predecessors, (589), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:56:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 719 transitions. [2025-02-06 03:56:30,305 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 719 transitions. Word has length 151 [2025-02-06 03:56:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 719 transitions. [2025-02-06 03:56:30,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 719 transitions. [2025-02-06 03:56:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:30,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:30,306 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:56:30,307 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 492224877, now seen corresponding path program 1 times [2025-02-06 03:56:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758240553] [2025-02-06 03:56:30,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:30,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758240553] [2025-02-06 03:56:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758240553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:30,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:56:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241515322] [2025-02-06 03:56:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:30,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:56:30,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:30,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:56:30,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:30,895 INFO L87 Difference]: Start difference. First operand 571 states and 719 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:31,503 INFO L93 Difference]: Finished difference Result 1219 states and 1528 transitions. [2025-02-06 03:56:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:56:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-02-06 03:56:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:31,507 INFO L225 Difference]: With dead ends: 1219 [2025-02-06 03:56:31,507 INFO L226 Difference]: Without dead ends: 672 [2025-02-06 03:56:31,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:56:31,508 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:31,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 908 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-02-06 03:56:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 571. [2025-02-06 03:56:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 487 states have (on average 1.2053388090349075) internal successors, (587), 493 states have internal predecessors, (587), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:56:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 717 transitions. [2025-02-06 03:56:31,541 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 717 transitions. Word has length 152 [2025-02-06 03:56:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 717 transitions. [2025-02-06 03:56:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 717 transitions. [2025-02-06 03:56:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:31,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:31,544 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 03:56:31,544 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:31,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1999776686, now seen corresponding path program 1 times [2025-02-06 03:56:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139023186] [2025-02-06 03:56:31,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:31,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139023186] [2025-02-06 03:56:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139023186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:56:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457707011] [2025-02-06 03:56:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:56:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:56:31,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:31,808 INFO L87 Difference]: Start difference. First operand 571 states and 717 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:32,145 INFO L93 Difference]: Finished difference Result 1308 states and 1649 transitions. [2025-02-06 03:56:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:56:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:32,149 INFO L225 Difference]: With dead ends: 1308 [2025-02-06 03:56:32,149 INFO L226 Difference]: Without dead ends: 761 [2025-02-06 03:56:32,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:56:32,150 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 120 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1686 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-06 03:56:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 599. [2025-02-06 03:56:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 515 states have (on average 1.2077669902912622) internal successors, (622), 521 states have internal predecessors, (622), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:56:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 752 transitions. [2025-02-06 03:56:32,189 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 752 transitions. Word has length 152 [2025-02-06 03:56:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 752 transitions. [2025-02-06 03:56:32,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 752 transitions. [2025-02-06 03:56:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:32,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:32,190 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 03:56:32,191 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1393233838, now seen corresponding path program 1 times [2025-02-06 03:56:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161891902] [2025-02-06 03:56:32,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:32,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:32,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161891902] [2025-02-06 03:56:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161891902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:56:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507624402] [2025-02-06 03:56:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:33,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:56:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:33,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:56:33,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:56:33,222 INFO L87 Difference]: Start difference. First operand 599 states and 752 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:33,823 INFO L93 Difference]: Finished difference Result 1229 states and 1542 transitions. [2025-02-06 03:56:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:56:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-02-06 03:56:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:33,827 INFO L225 Difference]: With dead ends: 1229 [2025-02-06 03:56:33,827 INFO L226 Difference]: Without dead ends: 654 [2025-02-06 03:56:33,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:56:33,828 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 63 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:33,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1257 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-06 03:56:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 599. [2025-02-06 03:56:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 515 states have (on average 1.2077669902912622) internal successors, (622), 521 states have internal predecessors, (622), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:56:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 752 transitions. [2025-02-06 03:56:33,860 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 752 transitions. Word has length 152 [2025-02-06 03:56:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 752 transitions. [2025-02-06 03:56:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 752 transitions. [2025-02-06 03:56:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:33,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:33,861 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 03:56:33,861 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1394181649, now seen corresponding path program 1 times [2025-02-06 03:56:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384323647] [2025-02-06 03:56:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:33,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:33,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:33,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:33,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384323647] [2025-02-06 03:56:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384323647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:34,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047711392] [2025-02-06 03:56:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:34,096 INFO L87 Difference]: Start difference. First operand 599 states and 752 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:34,492 INFO L93 Difference]: Finished difference Result 1588 states and 1980 transitions. [2025-02-06 03:56:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:34,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:34,496 INFO L225 Difference]: With dead ends: 1588 [2025-02-06 03:56:34,496 INFO L226 Difference]: Without dead ends: 1013 [2025-02-06 03:56:34,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:34,497 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:34,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 628 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-06 03:56:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 670. [2025-02-06 03:56:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 583 states have (on average 1.2109777015437393) internal successors, (706), 590 states have internal predecessors, (706), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:56:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2025-02-06 03:56:34,532 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 152 [2025-02-06 03:56:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:34,533 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2025-02-06 03:56:34,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2025-02-06 03:56:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:34,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:34,534 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 03:56:34,534 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash 643874640, now seen corresponding path program 1 times [2025-02-06 03:56:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828704913] [2025-02-06 03:56:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:34,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:34,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:34,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:34,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828704913] [2025-02-06 03:56:34,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828704913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:34,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:34,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606697253] [2025-02-06 03:56:34,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:34,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:34,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:34,750 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:35,162 INFO L93 Difference]: Finished difference Result 1710 states and 2116 transitions. [2025-02-06 03:56:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:56:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:35,170 INFO L225 Difference]: With dead ends: 1710 [2025-02-06 03:56:35,172 INFO L226 Difference]: Without dead ends: 1064 [2025-02-06 03:56:35,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:35,174 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 112 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:35,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 798 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-02-06 03:56:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 670. [2025-02-06 03:56:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 583 states have (on average 1.2109777015437393) internal successors, (706), 590 states have internal predecessors, (706), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:56:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2025-02-06 03:56:35,245 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 152 [2025-02-06 03:56:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:35,245 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2025-02-06 03:56:35,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2025-02-06 03:56:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:35,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:35,246 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:35,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 03:56:35,246 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:35,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1138497293, now seen corresponding path program 1 times [2025-02-06 03:56:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262601247] [2025-02-06 03:56:35,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:35,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:35,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262601247] [2025-02-06 03:56:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262601247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702491310] [2025-02-06 03:56:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:35,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:35,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:35,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:35,382 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:35,585 INFO L93 Difference]: Finished difference Result 1323 states and 1653 transitions. [2025-02-06 03:56:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:35,588 INFO L225 Difference]: With dead ends: 1323 [2025-02-06 03:56:35,588 INFO L226 Difference]: Without dead ends: 677 [2025-02-06 03:56:35,589 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-02-06 03:56:35,590 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:35,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-06 03:56:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 628. [2025-02-06 03:56:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 541 states have (on average 1.201478743068392) internal successors, (650), 548 states have internal predecessors, (650), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:56:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 784 transitions. [2025-02-06 03:56:35,627 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 784 transitions. Word has length 152 [2025-02-06 03:56:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:35,627 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 784 transitions. [2025-02-06 03:56:35,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 784 transitions. [2025-02-06 03:56:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:35,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:35,628 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:35,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 03:56:35,629 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1427198590, now seen corresponding path program 1 times [2025-02-06 03:56:35,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:35,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618063782] [2025-02-06 03:56:35,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:35,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:35,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:35,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618063782] [2025-02-06 03:56:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618063782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460510018] [2025-02-06 03:56:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:36,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:36,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:36,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:36,277 INFO L87 Difference]: Start difference. First operand 628 states and 784 transitions. Second operand has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:36,580 INFO L93 Difference]: Finished difference Result 1567 states and 1942 transitions. [2025-02-06 03:56:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-02-06 03:56:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:36,588 INFO L225 Difference]: With dead ends: 1567 [2025-02-06 03:56:36,588 INFO L226 Difference]: Without dead ends: 963 [2025-02-06 03:56:36,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-02-06 03:56:36,590 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 50 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:36,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 503 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-06 03:56:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 809. [2025-02-06 03:56:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 722 states have (on average 1.1869806094182827) internal successors, (857), 729 states have internal predecessors, (857), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 03:56:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 991 transitions. [2025-02-06 03:56:36,630 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 991 transitions. Word has length 152 [2025-02-06 03:56:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:36,630 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 991 transitions. [2025-02-06 03:56:36,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 03:56:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 991 transitions. [2025-02-06 03:56:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:36,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:36,631 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:36,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 03:56:36,632 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:36,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash -369752769, now seen corresponding path program 1 times [2025-02-06 03:56:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651698360] [2025-02-06 03:56:36,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:36,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:36,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:36,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:36,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651698360] [2025-02-06 03:56:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651698360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:37,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:37,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434487776] [2025-02-06 03:56:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:37,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:37,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:37,403 INFO L87 Difference]: Start difference. First operand 809 states and 991 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:37,664 INFO L93 Difference]: Finished difference Result 836 states and 1023 transitions. [2025-02-06 03:56:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:56:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-02-06 03:56:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:37,667 INFO L225 Difference]: With dead ends: 836 [2025-02-06 03:56:37,667 INFO L226 Difference]: Without dead ends: 834 [2025-02-06 03:56:37,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:56:37,668 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 47 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:37,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 627 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-02-06 03:56:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 773. [2025-02-06 03:56:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 696 states have (on average 1.1853448275862069) internal successors, (825), 701 states have internal predecessors, (825), 59 states have call successors, (59), 17 states have call predecessors, (59), 17 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 03:56:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 943 transitions. [2025-02-06 03:56:37,719 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 943 transitions. Word has length 152 [2025-02-06 03:56:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:37,720 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 943 transitions. [2025-02-06 03:56:37,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 943 transitions. [2025-02-06 03:56:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:37,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:37,722 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:37,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 03:56:37,722 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -368829248, now seen corresponding path program 1 times [2025-02-06 03:56:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525443629] [2025-02-06 03:56:37,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:37,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:37,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:37,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525443629] [2025-02-06 03:56:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525443629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759250927] [2025-02-06 03:56:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:37,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:37,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:37,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:37,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:37,863 INFO L87 Difference]: Start difference. First operand 773 states and 943 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:38,039 INFO L93 Difference]: Finished difference Result 1599 states and 1951 transitions. [2025-02-06 03:56:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:38,043 INFO L225 Difference]: With dead ends: 1599 [2025-02-06 03:56:38,043 INFO L226 Difference]: Without dead ends: 829 [2025-02-06 03:56:38,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:38,045 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 85 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:38,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 500 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-02-06 03:56:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 828. [2025-02-06 03:56:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 729 states have (on average 1.168724279835391) internal successors, (852), 735 states have internal predecessors, (852), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 03:56:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1004 transitions. [2025-02-06 03:56:38,093 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1004 transitions. Word has length 152 [2025-02-06 03:56:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1004 transitions. [2025-02-06 03:56:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1004 transitions. [2025-02-06 03:56:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:56:38,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:38,094 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:38,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 03:56:38,095 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:38,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash 518674433, now seen corresponding path program 1 times [2025-02-06 03:56:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551260595] [2025-02-06 03:56:38,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:38,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:38,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:38,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:56:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551260595] [2025-02-06 03:56:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551260595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890405183] [2025-02-06 03:56:38,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:38,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:38,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:56:38,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:56:38,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:56:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:38,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:56:38,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:38,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890405183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:56:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829886141] [2025-02-06 03:56:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:38,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:38,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:38,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:38,413 INFO L87 Difference]: Start difference. First operand 828 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:38,492 INFO L93 Difference]: Finished difference Result 1620 states and 1965 transitions. [2025-02-06 03:56:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:56:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:38,494 INFO L225 Difference]: With dead ends: 1620 [2025-02-06 03:56:38,494 INFO L226 Difference]: Without dead ends: 846 [2025-02-06 03:56:38,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 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-02-06 03:56:38,496 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:38,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-02-06 03:56:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2025-02-06 03:56:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 747 states have (on average 1.1646586345381527) internal successors, (870), 753 states have internal predecessors, (870), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 03:56:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1022 transitions. [2025-02-06 03:56:38,547 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1022 transitions. Word has length 152 [2025-02-06 03:56:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:38,547 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1022 transitions. [2025-02-06 03:56:38,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1022 transitions. [2025-02-06 03:56:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:56:38,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:38,548 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:38,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:56:38,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:38,749 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -531776574, now seen corresponding path program 1 times [2025-02-06 03:56:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124031465] [2025-02-06 03:56:38,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:38,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:38,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:38,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124031465] [2025-02-06 03:56:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124031465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443870362] [2025-02-06 03:56:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:38,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:38,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:38,944 INFO L87 Difference]: Start difference. First operand 846 states and 1022 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:39,185 INFO L93 Difference]: Finished difference Result 1706 states and 2050 transitions. [2025-02-06 03:56:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:39,185 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-02-06 03:56:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:39,187 INFO L225 Difference]: With dead ends: 1706 [2025-02-06 03:56:39,188 INFO L226 Difference]: Without dead ends: 914 [2025-02-06 03:56:39,188 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-02-06 03:56:39,189 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 44 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:39,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 502 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-02-06 03:56:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 826. [2025-02-06 03:56:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 727 states have (on average 1.1636863823933976) internal successors, (846), 733 states have internal predecessors, (846), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 03:56:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 998 transitions. [2025-02-06 03:56:39,244 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 998 transitions. Word has length 153 [2025-02-06 03:56:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:39,245 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 998 transitions. [2025-02-06 03:56:39,245 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 998 transitions. [2025-02-06 03:56:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:56:39,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:39,246 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 03:56:39,246 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1249063754, now seen corresponding path program 1 times [2025-02-06 03:56:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180035406] [2025-02-06 03:56:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:39,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:39,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180035406] [2025-02-06 03:56:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180035406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:56:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434155708] [2025-02-06 03:56:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:56:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:39,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:56:39,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:56:39,944 INFO L87 Difference]: Start difference. First operand 826 states and 998 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:40,522 INFO L93 Difference]: Finished difference Result 1771 states and 2136 transitions. [2025-02-06 03:56:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:56:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-02-06 03:56:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:40,525 INFO L225 Difference]: With dead ends: 1771 [2025-02-06 03:56:40,525 INFO L226 Difference]: Without dead ends: 999 [2025-02-06 03:56:40,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:56:40,527 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 63 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1215 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-02-06 03:56:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 882. [2025-02-06 03:56:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 766 states have (on average 1.1579634464751958) internal successors, (887), 774 states have internal predecessors, (887), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 03:56:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1063 transitions. [2025-02-06 03:56:40,585 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1063 transitions. Word has length 153 [2025-02-06 03:56:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:40,586 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1063 transitions. [2025-02-06 03:56:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1063 transitions. [2025-02-06 03:56:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:56:40,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:40,587 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-06 03:56:40,587 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 480601571, now seen corresponding path program 1 times [2025-02-06 03:56:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376785268] [2025-02-06 03:56:40,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:40,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:56:40,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:56:40,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:40,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376785268] [2025-02-06 03:56:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376785268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749726873] [2025-02-06 03:56:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:41,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:41,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:41,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:41,237 INFO L87 Difference]: Start difference. First operand 882 states and 1063 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:41,671 INFO L93 Difference]: Finished difference Result 2084 states and 2459 transitions. [2025-02-06 03:56:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-02-06 03:56:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:41,675 INFO L225 Difference]: With dead ends: 2084 [2025-02-06 03:56:41,675 INFO L226 Difference]: Without dead ends: 1256 [2025-02-06 03:56:41,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:56:41,678 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 42 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:41,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 619 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-02-06 03:56:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1170. [2025-02-06 03:56:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1024 states have (on average 1.1201171875) internal successors, (1147), 1037 states have internal predecessors, (1147), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1363 transitions. [2025-02-06 03:56:41,768 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1363 transitions. Word has length 154 [2025-02-06 03:56:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1363 transitions. [2025-02-06 03:56:41,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:56:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1363 transitions. [2025-02-06 03:56:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:56:41,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:41,769 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-06 03:56:41,770 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1028741123, now seen corresponding path program 1 times [2025-02-06 03:56:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236515877] [2025-02-06 03:56:41,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:41,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:56:41,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:56:41,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236515877] [2025-02-06 03:56:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236515877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:41,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673351780] [2025-02-06 03:56:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:41,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:41,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:41,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:41,996 INFO L87 Difference]: Start difference. First operand 1170 states and 1363 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:42,483 INFO L93 Difference]: Finished difference Result 2686 states and 3116 transitions. [2025-02-06 03:56:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-02-06 03:56:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:42,491 INFO L225 Difference]: With dead ends: 2686 [2025-02-06 03:56:42,495 INFO L226 Difference]: Without dead ends: 1570 [2025-02-06 03:56:42,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:42,498 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 51 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:42,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 629 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-02-06 03:56:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1325. [2025-02-06 03:56:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1179 states have (on average 1.112807463952502) internal successors, (1312), 1192 states have internal predecessors, (1312), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1528 transitions. [2025-02-06 03:56:42,605 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1528 transitions. Word has length 154 [2025-02-06 03:56:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1528 transitions. [2025-02-06 03:56:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1528 transitions. [2025-02-06 03:56:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:56:42,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:42,608 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-06 03:56:42,608 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 735338116, now seen corresponding path program 1 times [2025-02-06 03:56:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746524769] [2025-02-06 03:56:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:42,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:56:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:56:42,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:42,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746524769] [2025-02-06 03:56:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746524769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:56:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017557613] [2025-02-06 03:56:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:56:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:43,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:56:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:43,631 INFO L87 Difference]: Start difference. First operand 1325 states and 1528 transitions. Second operand has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:44,400 INFO L93 Difference]: Finished difference Result 2823 states and 3240 transitions. [2025-02-06 03:56:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:56:44,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2025-02-06 03:56:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:44,405 INFO L225 Difference]: With dead ends: 2823 [2025-02-06 03:56:44,405 INFO L226 Difference]: Without dead ends: 1552 [2025-02-06 03:56:44,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:44,407 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 42 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:44,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 935 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-02-06 03:56:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1320. [2025-02-06 03:56:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1174 states have (on average 1.1132879045996593) internal successors, (1307), 1187 states have internal predecessors, (1307), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1523 transitions. [2025-02-06 03:56:44,508 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1523 transitions. Word has length 154 [2025-02-06 03:56:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1523 transitions. [2025-02-06 03:56:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:56:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1523 transitions. [2025-02-06 03:56:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 03:56:44,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:44,510 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-06 03:56:44,510 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 621765285, now seen corresponding path program 1 times [2025-02-06 03:56:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067576765] [2025-02-06 03:56:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 03:56:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 03:56:44,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067576765] [2025-02-06 03:56:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067576765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668632546] [2025-02-06 03:56:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:44,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:44,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:44,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:44,740 INFO L87 Difference]: Start difference. First operand 1320 states and 1523 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:45,201 INFO L93 Difference]: Finished difference Result 3842 states and 4426 transitions. [2025-02-06 03:56:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:56:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-02-06 03:56:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:45,206 INFO L225 Difference]: With dead ends: 3842 [2025-02-06 03:56:45,206 INFO L226 Difference]: Without dead ends: 1352 [2025-02-06 03:56:45,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:56:45,209 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 103 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:45,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1049 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-06 03:56:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1328. [2025-02-06 03:56:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1182 states have (on average 1.0905245346869712) internal successors, (1289), 1195 states have internal predecessors, (1289), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:56:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1505 transitions. [2025-02-06 03:56:45,325 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1505 transitions. Word has length 155 [2025-02-06 03:56:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:45,326 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1505 transitions. [2025-02-06 03:56:45,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1505 transitions. [2025-02-06 03:56:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 03:56:45,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:45,327 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-06 03:56:45,328 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:45,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1583379302, now seen corresponding path program 1 times [2025-02-06 03:56:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661607964] [2025-02-06 03:56:45,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:45,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 03:56:45,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 03:56:45,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:56:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693585986] [2025-02-06 03:56:45,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:45,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:45,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:56:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 03:56:45,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 03:56:45,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:45,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 03:56:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:45,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:56:45,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:45,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2025-02-06 03:56:46,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:56:46,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 38 [2025-02-06 03:56:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:56:46,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661607964] [2025-02-06 03:56:46,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:56:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693585986] [2025-02-06 03:56:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693585986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954245075] [2025-02-06 03:56:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:46,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:46,121 INFO L87 Difference]: Start difference. First operand 1328 states and 1505 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:47,406 INFO L93 Difference]: Finished difference Result 2585 states and 2914 transitions. [2025-02-06 03:56:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-02-06 03:56:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:47,409 INFO L225 Difference]: With dead ends: 2585 [2025-02-06 03:56:47,410 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:56:47,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:47,412 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 91 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:47,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 498 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:56:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:56:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:56:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 03:56:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:56:47,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2025-02-06 03:56:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:47,414 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:56:47,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:56:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:56:47,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:56:47,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:56:47,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:56:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:47,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:47,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.