./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:25:23,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:25:23,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:25:23,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:25:23,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:25:23,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:25:23,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:25:23,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:25:23,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:25:23,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:25:23,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:25:23,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:25:23,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:25:23,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:25:23,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:25:23,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:25:23,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:25:23,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:25:23,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:25:23,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:25:23,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:25:23,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:25:23,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:23,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:25:23,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588d5c1b74b435c7b48e7846cdcbcdd05a5e0ef56f650b6f67ae59d316b919cf [2025-03-17 05:25:23,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:25:23,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:25:23,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:25:23,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:25:23,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:25:23,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2025-03-17 05:25:24,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9d04150/7536759b05c24606a55ddce3126b4979/FLAG8d53e10fe [2025-03-17 05:25:25,072 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:25:25,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i [2025-03-17 05:25:25,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9d04150/7536759b05c24606a55ddce3126b4979/FLAG8d53e10fe [2025-03-17 05:25:25,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9d04150/7536759b05c24606a55ddce3126b4979 [2025-03-17 05:25:25,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:25:25,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:25:25,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:25,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:25:25,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:25:25,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad74007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25, skipping insertion in model container [2025-03-17 05:25:25,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:25:25,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i[916,929] [2025-03-17 05:25:25,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:25,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:25:25,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-58.i[916,929] [2025-03-17 05:25:25,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:25,346 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:25:25,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25 WrapperNode [2025-03-17 05:25:25,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:25,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:25,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:25:25,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:25:25,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,405 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2025-03-17 05:25:25,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:25,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:25:25,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:25:25,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:25:25,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,447 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2025-03-17 05:25:25,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:25:25,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:25:25,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:25:25,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:25:25,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (1/1) ... [2025-03-17 05:25:25,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:25,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:25:25,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:25:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:25:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:25:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:25:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:25:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:25:25,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:25:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:25:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:25:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:25:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:25:25,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:25:25,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:25:25,608 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:25:25,933 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem68#1;havoc property_#t~ite83#1;havoc property_#t~mem74#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~ite73#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite115#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:25:25,961 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:25:25,961 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:25:25,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:25:25,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:25:25,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:25 BoogieIcfgContainer [2025-03-17 05:25:25,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:25:25,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:25:25,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:25:25,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:25:25,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:25:25" (1/3) ... [2025-03-17 05:25:25,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed11a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:25, skipping insertion in model container [2025-03-17 05:25:25,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:25" (2/3) ... [2025-03-17 05:25:25,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed11a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:25, skipping insertion in model container [2025-03-17 05:25:25,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:25" (3/3) ... [2025-03-17 05:25:25,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-58.i [2025-03-17 05:25:25,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:25:25,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-58.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:25:26,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:25:26,045 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;@32bf8ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:25:26,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:25:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:26,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:26,058 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:26,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1505427158, now seen corresponding path program 1 times [2025-03-17 05:25:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:26,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893548213] [2025-03-17 05:25:26,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:26,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:26,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:25:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893548213] [2025-03-17 05:25:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893548213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720065951] [2025-03-17 05:25:26,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:25:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:26,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:25:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:25:26,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:26,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:26,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:26,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:25:26,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:25:26,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720065951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:25:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11216096] [2025-03-17 05:25:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:25:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:25:26,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:26,573 INFO L87 Difference]: Start difference. First operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:26,590 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2025-03-17 05:25:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:25:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:25:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:26,595 INFO L225 Difference]: With dead ends: 165 [2025-03-17 05:25:26,595 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:25:26,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:26,599 INFO L435 NwaCegarLoop]: 114 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, 114 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-03-17 05:25:26,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:25:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 05:25:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-17 05:25:26,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 112 [2025-03-17 05:25:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-17 05:25:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-17 05:25:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:26,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:26,634 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:26,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:25:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:25:26,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1811888891, now seen corresponding path program 1 times [2025-03-17 05:25:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59275464] [2025-03-17 05:25:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:26,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:26,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:27,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59275464] [2025-03-17 05:25:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59275464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:27,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296016225] [2025-03-17 05:25:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:27,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:27,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:27,098 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:27,135 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2025-03-17 05:25:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:27,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:25:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:27,137 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:25:27,137 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:25:27,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:27,138 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:27,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:25:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:25:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-17 05:25:27,149 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 112 [2025-03-17 05:25:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:27,152 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-17 05:25:27,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-17 05:25:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:27,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:27,157 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:27,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:25:27,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1812812412, now seen corresponding path program 1 times [2025-03-17 05:25:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963934925] [2025-03-17 05:25:27,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:27,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:27,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:27,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:27,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963934925] [2025-03-17 05:25:27,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963934925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:27,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372797098] [2025-03-17 05:25:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:27,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:27,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:27,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:27,621 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:27,899 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2025-03-17 05:25:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:27,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:25:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:27,902 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:25:27,903 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 05:25:27,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:27,905 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 103 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:27,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 503 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 05:25:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2025-03-17 05:25:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:25:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 224 transitions. [2025-03-17 05:25:27,933 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 224 transitions. Word has length 112 [2025-03-17 05:25:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:27,934 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 224 transitions. [2025-03-17 05:25:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 224 transitions. [2025-03-17 05:25:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:27,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:27,936 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:25:27,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1737306880, now seen corresponding path program 1 times [2025-03-17 05:25:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18758262] [2025-03-17 05:25:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:27,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:28,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:28,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18758262] [2025-03-17 05:25:28,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18758262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:28,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:28,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:25:28,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720275563] [2025-03-17 05:25:28,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:28,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:25:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:28,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:25:28,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:28,707 INFO L87 Difference]: Start difference. First operand 158 states and 224 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:28,968 INFO L93 Difference]: Finished difference Result 383 states and 540 transitions. [2025-03-17 05:25:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:25:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:28,971 INFO L225 Difference]: With dead ends: 383 [2025-03-17 05:25:28,971 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:25:28,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:28,972 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 82 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:28,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 612 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:25:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2025-03-17 05:25:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.303370786516854) internal successors, (232), 179 states have internal predecessors, (232), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:25:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 314 transitions. [2025-03-17 05:25:28,996 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 314 transitions. Word has length 112 [2025-03-17 05:25:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:28,997 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 314 transitions. [2025-03-17 05:25:28,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 314 transitions. [2025-03-17 05:25:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:28,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:28,998 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:25:28,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:28,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1608224161, now seen corresponding path program 1 times [2025-03-17 05:25:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826827155] [2025-03-17 05:25:28,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:29,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:29,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826827155] [2025-03-17 05:25:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826827155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:30,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494564473] [2025-03-17 05:25:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:30,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:25:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:30,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:25:30,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:30,249 INFO L87 Difference]: Start difference. First operand 223 states and 314 transitions. Second operand has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:30,685 INFO L93 Difference]: Finished difference Result 472 states and 659 transitions. [2025-03-17 05:25:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:25:30,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2025-03-17 05:25:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:30,689 INFO L225 Difference]: With dead ends: 472 [2025-03-17 05:25:30,689 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 05:25:30,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:30,690 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 79 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:30,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 625 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:25:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 05:25:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2025-03-17 05:25:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 188 states have internal predecessors, (238), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:25:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 330 transitions. [2025-03-17 05:25:30,716 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 330 transitions. Word has length 112 [2025-03-17 05:25:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:30,716 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 330 transitions. [2025-03-17 05:25:30,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 330 transitions. [2025-03-17 05:25:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:30,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:30,718 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:30,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:25:30,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash -383997183, now seen corresponding path program 1 times [2025-03-17 05:25:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:30,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023432965] [2025-03-17 05:25:30,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:30,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:30,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:30,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:30,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023432965] [2025-03-17 05:25:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023432965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:31,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485409679] [2025-03-17 05:25:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:31,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:25:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:31,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:25:31,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:31,759 INFO L87 Difference]: Start difference. First operand 238 states and 330 transitions. Second operand has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:32,235 INFO L93 Difference]: Finished difference Result 514 states and 712 transitions. [2025-03-17 05:25:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:25:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2025-03-17 05:25:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:32,240 INFO L225 Difference]: With dead ends: 514 [2025-03-17 05:25:32,241 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 05:25:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:32,243 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:32,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 802 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:25:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 05:25:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2025-03-17 05:25:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.2869565217391303) internal successors, (296), 233 states have internal predecessors, (296), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:25:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 398 transitions. [2025-03-17 05:25:32,277 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 398 transitions. Word has length 112 [2025-03-17 05:25:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:32,277 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 398 transitions. [2025-03-17 05:25:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.666666666666667) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 398 transitions. [2025-03-17 05:25:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:32,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:32,279 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:25:32,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:32,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -254914464, now seen corresponding path program 1 times [2025-03-17 05:25:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389596576] [2025-03-17 05:25:32,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:32,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389596576] [2025-03-17 05:25:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389596576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:32,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:32,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:25:32,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495288915] [2025-03-17 05:25:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:32,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:32,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:32,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:32,890 INFO L87 Difference]: Start difference. First operand 288 states and 398 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:33,151 INFO L93 Difference]: Finished difference Result 564 states and 779 transitions. [2025-03-17 05:25:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:25:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:33,154 INFO L225 Difference]: With dead ends: 564 [2025-03-17 05:25:33,154 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 05:25:33,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 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-03-17 05:25:33,155 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 62 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:33,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 861 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 05:25:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2025-03-17 05:25:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 233 states have internal predecessors, (295), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:25:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2025-03-17 05:25:33,175 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 112 [2025-03-17 05:25:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:33,175 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2025-03-17 05:25:33,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2025-03-17 05:25:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:33,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:33,176 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:33,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:25:33,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:33,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1208601102, now seen corresponding path program 1 times [2025-03-17 05:25:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076976918] [2025-03-17 05:25:33,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:33,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:33,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:33,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:33,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076976918] [2025-03-17 05:25:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076976918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:33,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:25:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496701302] [2025-03-17 05:25:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:25:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:25:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:25:33,945 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 12 states, 9 states have (on average 4.555555555555555) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:34,546 INFO L93 Difference]: Finished difference Result 696 states and 962 transitions. [2025-03-17 05:25:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:25:34,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.555555555555555) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2025-03-17 05:25:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:34,548 INFO L225 Difference]: With dead ends: 696 [2025-03-17 05:25:34,548 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 05:25:34,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:25:34,552 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 85 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:34,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 922 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:25:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 05:25:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2025-03-17 05:25:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 337 states have (on average 1.2878338278931751) internal successors, (434), 342 states have internal predecessors, (434), 73 states have call successors, (73), 8 states have call predecessors, (73), 8 states have return successors, (73), 68 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:25:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 580 transitions. [2025-03-17 05:25:34,592 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 580 transitions. Word has length 113 [2025-03-17 05:25:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:34,592 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 580 transitions. [2025-03-17 05:25:34,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.555555555555555) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:25:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 580 transitions. [2025-03-17 05:25:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:34,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:34,594 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:34,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:25:34,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:34,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1337683821, now seen corresponding path program 1 times [2025-03-17 05:25:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731495403] [2025-03-17 05:25:34,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:34,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:34,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731495403] [2025-03-17 05:25:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731495403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521969583] [2025-03-17 05:25:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:35,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:35,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:35,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:35,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:35,069 INFO L87 Difference]: Start difference. First operand 419 states and 580 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:35,383 INFO L93 Difference]: Finished difference Result 845 states and 1163 transitions. [2025-03-17 05:25:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2025-03-17 05:25:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:35,388 INFO L225 Difference]: With dead ends: 845 [2025-03-17 05:25:35,388 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 05:25:35,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:35,390 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 77 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:35,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 379 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 05:25:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 438. [2025-03-17 05:25:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.2750716332378222) internal successors, (445), 354 states have internal predecessors, (445), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:25:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2025-03-17 05:25:35,426 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 113 [2025-03-17 05:25:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:35,426 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2025-03-17 05:25:35,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2025-03-17 05:25:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:35,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:35,428 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:35,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:25:35,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:35,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1953449106, now seen corresponding path program 1 times [2025-03-17 05:25:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415508824] [2025-03-17 05:25:35,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:35,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:35,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415508824] [2025-03-17 05:25:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415508824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54620689] [2025-03-17 05:25:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:35,630 INFO L87 Difference]: Start difference. First operand 438 states and 599 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:35,803 INFO L93 Difference]: Finished difference Result 776 states and 1061 transitions. [2025-03-17 05:25:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:25:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:35,805 INFO L225 Difference]: With dead ends: 776 [2025-03-17 05:25:35,805 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 05:25:35,806 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-03-17 05:25:35,806 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 102 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:35,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 423 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 05:25:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-03-17 05:25:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 248 states have (on average 1.2379032258064515) internal successors, (307), 251 states have internal predecessors, (307), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 05:25:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 429 transitions. [2025-03-17 05:25:35,836 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 429 transitions. Word has length 113 [2025-03-17 05:25:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 429 transitions. [2025-03-17 05:25:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2025-03-17 05:25:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:35,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:35,839 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:25:35,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 211528749, now seen corresponding path program 1 times [2025-03-17 05:25:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937367950] [2025-03-17 05:25:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:35,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:35,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:35,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:35,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937367950] [2025-03-17 05:25:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937367950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:36,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365971486] [2025-03-17 05:25:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:36,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:36,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:36,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:36,289 INFO L87 Difference]: Start difference. First operand 319 states and 429 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:36,559 INFO L93 Difference]: Finished difference Result 618 states and 829 transitions. [2025-03-17 05:25:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:36,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2025-03-17 05:25:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:36,562 INFO L225 Difference]: With dead ends: 618 [2025-03-17 05:25:36,562 INFO L226 Difference]: Without dead ends: 326 [2025-03-17 05:25:36,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:36,563 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:36,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 433 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-17 05:25:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2025-03-17 05:25:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 251 states have (on average 1.2310756972111554) internal successors, (309), 254 states have internal predecessors, (309), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 05:25:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 431 transitions. [2025-03-17 05:25:36,592 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 431 transitions. Word has length 113 [2025-03-17 05:25:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 431 transitions. [2025-03-17 05:25:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 431 transitions. [2025-03-17 05:25:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:36,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:36,597 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:36,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:25:36,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 340611468, now seen corresponding path program 1 times [2025-03-17 05:25:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:36,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916470825] [2025-03-17 05:25:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:36,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:36,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916470825] [2025-03-17 05:25:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916470825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:25:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986174023] [2025-03-17 05:25:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:25:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:25:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:37,007 INFO L87 Difference]: Start difference. First operand 323 states and 431 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:37,425 INFO L93 Difference]: Finished difference Result 622 states and 830 transitions. [2025-03-17 05:25:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:25:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2025-03-17 05:25:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:37,434 INFO L225 Difference]: With dead ends: 622 [2025-03-17 05:25:37,434 INFO L226 Difference]: Without dead ends: 326 [2025-03-17 05:25:37,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:25:37,437 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 74 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:37,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1077 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-17 05:25:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2025-03-17 05:25:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 251 states have (on average 1.2270916334661355) internal successors, (308), 254 states have internal predecessors, (308), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 05:25:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 430 transitions. [2025-03-17 05:25:37,467 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 430 transitions. Word has length 113 [2025-03-17 05:25:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:37,468 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 430 transitions. [2025-03-17 05:25:37,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 430 transitions. [2025-03-17 05:25:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:25:37,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:37,469 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:37,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:25:37,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1373708339, now seen corresponding path program 1 times [2025-03-17 05:25:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697929021] [2025-03-17 05:25:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:37,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:25:37,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:25:37,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:37,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697929021] [2025-03-17 05:25:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697929021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:25:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865466885] [2025-03-17 05:25:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:37,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:37,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:37,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:37,731 INFO L87 Difference]: Start difference. First operand 323 states and 430 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:37,915 INFO L93 Difference]: Finished difference Result 845 states and 1121 transitions. [2025-03-17 05:25:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:25:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2025-03-17 05:25:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:37,918 INFO L225 Difference]: With dead ends: 845 [2025-03-17 05:25:37,919 INFO L226 Difference]: Without dead ends: 549 [2025-03-17 05:25:37,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:37,921 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:37,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 563 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-17 05:25:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 457. [2025-03-17 05:25:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 363 states have (on average 1.2121212121212122) internal successors, (440), 368 states have internal predecessors, (440), 79 states have call successors, (79), 14 states have call predecessors, (79), 14 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 05:25:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 598 transitions. [2025-03-17 05:25:37,961 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 598 transitions. Word has length 114 [2025-03-17 05:25:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:37,961 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 598 transitions. [2025-03-17 05:25:37,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 598 transitions. [2025-03-17 05:25:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:25:37,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:37,964 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:37,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:25:37,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1634352254, now seen corresponding path program 1 times [2025-03-17 05:25:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433023080] [2025-03-17 05:25:37,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:37,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:25:38,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:25:38,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:38,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433023080] [2025-03-17 05:25:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433023080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154235974] [2025-03-17 05:25:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:25:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:38,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:25:38,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:38,821 INFO L87 Difference]: Start difference. First operand 457 states and 598 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:25:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:39,805 INFO L93 Difference]: Finished difference Result 961 states and 1250 transitions. [2025-03-17 05:25:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:25:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2025-03-17 05:25:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:39,809 INFO L225 Difference]: With dead ends: 961 [2025-03-17 05:25:39,809 INFO L226 Difference]: Without dead ends: 531 [2025-03-17 05:25:39,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:25:39,811 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 67 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:39,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 629 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:25:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-17 05:25:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2025-03-17 05:25:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 424 states have (on average 1.2099056603773586) internal successors, (513), 431 states have internal predecessors, (513), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:25:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 679 transitions. [2025-03-17 05:25:39,855 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 679 transitions. Word has length 115 [2025-03-17 05:25:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 679 transitions. [2025-03-17 05:25:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:25:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 679 transitions. [2025-03-17 05:25:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:25:39,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:39,858 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:39,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:25:39,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:39,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1284094922, now seen corresponding path program 1 times [2025-03-17 05:25:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400119037] [2025-03-17 05:25:39,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:25:39,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:25:39,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:39,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400119037] [2025-03-17 05:25:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400119037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:40,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900058107] [2025-03-17 05:25:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:25:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:40,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:25:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:40,531 INFO L87 Difference]: Start difference. First operand 527 states and 679 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:40,901 INFO L93 Difference]: Finished difference Result 537 states and 689 transitions. [2025-03-17 05:25:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:25:40,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-17 05:25:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:40,904 INFO L225 Difference]: With dead ends: 537 [2025-03-17 05:25:40,905 INFO L226 Difference]: Without dead ends: 535 [2025-03-17 05:25:40,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:25:40,906 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:40,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 716 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-17 05:25:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2025-03-17 05:25:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 430 states have (on average 1.2069767441860466) internal successors, (519), 437 states have internal predecessors, (519), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:25:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 685 transitions. [2025-03-17 05:25:40,945 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 685 transitions. Word has length 116 [2025-03-17 05:25:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:40,945 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 685 transitions. [2025-03-17 05:25:40,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 685 transitions. [2025-03-17 05:25:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:25:40,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:40,947 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:25:40,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1285018443, now seen corresponding path program 1 times [2025-03-17 05:25:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405812163] [2025-03-17 05:25:40,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:40,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:25:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:25:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:01,467 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:26:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:26:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405812163] [2025-03-17 05:26:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405812163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:18,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:18,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:26:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090202636] [2025-03-17 05:26:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:18,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:26:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:18,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:26:18,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:26:18,033 INFO L87 Difference]: Start difference. First operand 533 states and 685 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:26:35,831 WARN L286 SmtUtils]: Spent 16.78s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:26:52,630 WARN L286 SmtUtils]: Spent 16.18s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:26:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:53,352 INFO L93 Difference]: Finished difference Result 1551 states and 1995 transitions. [2025-03-17 05:26:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:26:53,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-03-17 05:26:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:53,358 INFO L225 Difference]: With dead ends: 1551 [2025-03-17 05:26:53,359 INFO L226 Difference]: Without dead ends: 1049 [2025-03-17 05:26:53,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:26:53,361 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 156 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:53,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 737 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 05:26:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-03-17 05:26:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 678. [2025-03-17 05:26:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 575 states have (on average 1.2243478260869565) internal successors, (704), 582 states have internal predecessors, (704), 83 states have call successors, (83), 19 states have call predecessors, (83), 19 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 05:26:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 870 transitions. [2025-03-17 05:26:53,427 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 870 transitions. Word has length 116 [2025-03-17 05:26:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:53,427 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 870 transitions. [2025-03-17 05:26:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:26:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 870 transitions. [2025-03-17 05:26:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:26:53,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:53,429 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:26:53,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:53,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash 984911658, now seen corresponding path program 1 times [2025-03-17 05:26:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742594486] [2025-03-17 05:26:53,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:53,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:26:53,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:26:53,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:53,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:26:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742594486] [2025-03-17 05:26:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742594486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:26:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645832877] [2025-03-17 05:26:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:26:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:55,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:26:55,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:26:55,835 INFO L87 Difference]: Start difference. First operand 678 states and 870 transitions. Second operand has 12 states, 9 states have (on average 4.888888888888889) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 4 states have call successors, (15)