./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.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 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:59,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:59,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:04:59,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:59,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:59,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:59,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:59,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:59,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:59,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:59,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:59,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:59,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:59,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:59,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:59,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:59,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:59,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:59,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:59,953 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:59,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:59,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:59,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:59,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:59,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:59,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:59,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:59,955 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 -> 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f [2025-03-17 06:05:00,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:05:00,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:05:00,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:05:00,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:05:00,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:05:00,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2025-03-17 06:05:02,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c4c0323/f71066cee3df4ff5aad29fd7be023900/FLAGb8358a0d4 [2025-03-17 06:05:02,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:05:02,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2025-03-17 06:05:02,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c4c0323/f71066cee3df4ff5aad29fd7be023900/FLAGb8358a0d4 [2025-03-17 06:05:02,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c4c0323/f71066cee3df4ff5aad29fd7be023900 [2025-03-17 06:05:02,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:05:02,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:05:02,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:05:02,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:05:02,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:05:02,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:05:02" (1/1) ... [2025-03-17 06:05:02,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df7b93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:02, skipping insertion in model container [2025-03-17 06:05:02,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:05:02" (1/1) ... [2025-03-17 06:05:02,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:05:03,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i[917,930] [2025-03-17 06:05:03,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:05:03,150 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:05:03,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i[917,930] [2025-03-17 06:05:03,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:05:03,216 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:05:03,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03 WrapperNode [2025-03-17 06:05:03,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:05:03,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:05:03,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:05:03,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:05:03,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,294 INFO L138 Inliner]: procedures = 30, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2025-03-17 06:05:03,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:05:03,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:05:03,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:05:03,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:05:03,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,325 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:05:03,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:05:03,371 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:05:03,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:05:03,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:05:03,372 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (1/1) ... [2025-03-17 06:05:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:05:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:03,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:05:03,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:05:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:05:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:05:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:05:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:05:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:05:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:05:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:05:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:05:03,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:05:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:05:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:05:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:05:03,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:05:03,652 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:05:04,321 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1; [2025-03-17 06:05:04,386 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 06:05:04,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:05:04,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:05:04,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:05:04,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:05:04 BoogieIcfgContainer [2025-03-17 06:05:04,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:05:04,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:05:04,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:05:04,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:05:04,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:05:02" (1/3) ... [2025-03-17 06:05:04,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fa7c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:05:04, skipping insertion in model container [2025-03-17 06:05:04,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:03" (2/3) ... [2025-03-17 06:05:04,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fa7c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:05:04, skipping insertion in model container [2025-03-17 06:05:04,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:05:04" (3/3) ... [2025-03-17 06:05:04,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-13.i [2025-03-17 06:05:04,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:05:04,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-13.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:05:04,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:05:04,582 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;@7795f681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:05:04,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:05:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 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 06:05:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:05:04,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:04,605 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:04,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:04,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1221886058, now seen corresponding path program 1 times [2025-03-17 06:05:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466727444] [2025-03-17 06:05:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:05:04,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:05:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:05,137 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 06:05:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466727444] [2025-03-17 06:05:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466727444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:05,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530706509] [2025-03-17 06:05:05,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:05,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:05:05,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:05:05,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:05:05,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:05:05,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:05,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:05:05,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:05,625 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 06:05:05,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530706509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:05:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:05:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839209518] [2025-03-17 06:05:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:05,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:05:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:05,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:05:05,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:05:05,671 INFO L87 Difference]: Start difference. First operand has 106 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 89 states have internal predecessors, (129), 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 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 06:05:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:05,708 INFO L93 Difference]: Finished difference Result 209 states and 331 transitions. [2025-03-17 06:05:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:05:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 127 [2025-03-17 06:05:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:05,717 INFO L225 Difference]: With dead ends: 209 [2025-03-17 06:05:05,718 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 06:05:05,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:05:05,726 INFO L435 NwaCegarLoop]: 155 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, 155 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 06:05:05,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 06:05:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 06:05:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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 06:05:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2025-03-17 06:05:05,786 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 127 [2025-03-17 06:05:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:05,787 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2025-03-17 06:05:05,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 06:05:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2025-03-17 06:05:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:05:05,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:05,790 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:05,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:05:05,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:05:05,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1103498399, now seen corresponding path program 1 times [2025-03-17 06:05:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141957708] [2025-03-17 06:05:05,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:06,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:05:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:05:06,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:06,652 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 06:05:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141957708] [2025-03-17 06:05:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141957708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:05:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116226392] [2025-03-17 06:05:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:06,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:05:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:06,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:05:06,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:05:06,660 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:06,723 INFO L93 Difference]: Finished difference Result 209 states and 312 transitions. [2025-03-17 06:05:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-17 06:05:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:06,733 INFO L225 Difference]: With dead ends: 209 [2025-03-17 06:05:06,733 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:05:06,734 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 06:05:06,734 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:06,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:05:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 06:05:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 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 06:05:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-03-17 06:05:06,760 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 127 [2025-03-17 06:05:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-03-17 06:05:06,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-03-17 06:05:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:05:06,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:06,769 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:06,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:05:06,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:06,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash 832161888, now seen corresponding path program 1 times [2025-03-17 06:05:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662933063] [2025-03-17 06:05:06,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:06,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:05:06,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:05:06,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:06,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:05:07,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:07,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662933063] [2025-03-17 06:05:07,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662933063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:07,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583285991] [2025-03-17 06:05:07,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:07,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:07,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:07,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:05:07,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:05:07,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:05:07,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:05:07,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:07,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:07,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:05:07,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:07,733 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 06:05:07,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583285991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:05:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:05:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775150017] [2025-03-17 06:05:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:05:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:07,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:05:07,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:07,737 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:05:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:07,818 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2025-03-17 06:05:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-17 06:05:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:07,827 INFO L225 Difference]: With dead ends: 213 [2025-03-17 06:05:07,828 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 06:05:07,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:07,834 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:07,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:05:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 06:05:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 06:05:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 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 06:05:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-03-17 06:05:07,849 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 127 [2025-03-17 06:05:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:07,850 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-03-17 06:05:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:05:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-03-17 06:05:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:05:07,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:07,853 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:07,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:05:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 06:05:08,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 953534174, now seen corresponding path program 1 times [2025-03-17 06:05:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350510807] [2025-03-17 06:05:08,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:08,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:05:08,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:05:08,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:08,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:08,664 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 06:05:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350510807] [2025-03-17 06:05:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350510807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:08,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:08,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:05:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453173377] [2025-03-17 06:05:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:08,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:05:08,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:08,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:05:08,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:05:08,668 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 06:05:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:08,860 INFO L93 Difference]: Finished difference Result 215 states and 317 transitions. [2025-03-17 06:05:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 129 [2025-03-17 06:05:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:08,866 INFO L225 Difference]: With dead ends: 215 [2025-03-17 06:05:08,867 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 06:05:08,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 06:05:08,868 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:08,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 385 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:05:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 06:05:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 06:05:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 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 06:05:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2025-03-17 06:05:08,888 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 129 [2025-03-17 06:05:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:08,894 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2025-03-17 06:05:08,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 06:05:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2025-03-17 06:05:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:05:08,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:08,897 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:05:08,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:08,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:08,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1082616893, now seen corresponding path program 1 times [2025-03-17 06:05:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276138264] [2025-03-17 06:05:08,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:08,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:05:09,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:05:09,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:09,678 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 06:05:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276138264] [2025-03-17 06:05:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276138264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:05:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369955965] [2025-03-17 06:05:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:09,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:05:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:09,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:05:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:05:09,686 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 06:05:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:09,998 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2025-03-17 06:05:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:05:10,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 129 [2025-03-17 06:05:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:10,002 INFO L225 Difference]: With dead ends: 249 [2025-03-17 06:05:10,005 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 06:05:10,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:05:10,006 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 93 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:10,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 415 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:05:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 06:05:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 112. [2025-03-17 06:05:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 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 06:05:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2025-03-17 06:05:10,022 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 129 [2025-03-17 06:05:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:10,024 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2025-03-17 06:05:10,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 06:05:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2025-03-17 06:05:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:05:10,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:10,027 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:05:10,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:10,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1859040706, now seen corresponding path program 1 times [2025-03-17 06:05:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189674210] [2025-03-17 06:05:10,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:10,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:05:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:05:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:13,093 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 06:05:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189674210] [2025-03-17 06:05:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189674210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:13,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:05:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750313084] [2025-03-17 06:05:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:13,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:05:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:13,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:05:13,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:05:13,095 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:14,143 INFO L93 Difference]: Finished difference Result 264 states and 386 transitions. [2025-03-17 06:05:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:05:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-03-17 06:05:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:14,146 INFO L225 Difference]: With dead ends: 264 [2025-03-17 06:05:14,149 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 06:05:14,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:05:14,151 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 379 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:14,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 412 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:05:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 06:05:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 117. [2025-03-17 06:05:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 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 06:05:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-17 06:05:14,194 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 129 [2025-03-17 06:05:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-17 06:05:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-17 06:05:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:14,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:14,197 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:05:14,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash 54923930, now seen corresponding path program 1 times [2025-03-17 06:05:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816808523] [2025-03-17 06:05:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:14,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:14,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:14,786 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 06:05:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:14,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816808523] [2025-03-17 06:05:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816808523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:05:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435616935] [2025-03-17 06:05:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:14,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:05:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:14,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:05:14,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:05:14,790 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:15,528 INFO L93 Difference]: Finished difference Result 284 states and 413 transitions. [2025-03-17 06:05:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:05:15,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:05:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:15,530 INFO L225 Difference]: With dead ends: 284 [2025-03-17 06:05:15,530 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 06:05:15,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:05:15,534 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 220 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:15,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 452 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:05:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 06:05:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2025-03-17 06:05:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 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 06:05:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-03-17 06:05:15,552 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 130 [2025-03-17 06:05:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:15,553 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-03-17 06:05:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-03-17 06:05:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:15,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:15,558 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:05:15,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -141589575, now seen corresponding path program 1 times [2025-03-17 06:05:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989360424] [2025-03-17 06:05:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:15,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:15,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:15,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:15,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:18,957 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 06:05:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989360424] [2025-03-17 06:05:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989360424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:18,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:18,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:05:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715513655] [2025-03-17 06:05:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:18,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:05:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:18,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:05:18,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:05:18,964 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:20,921 INFO L93 Difference]: Finished difference Result 380 states and 548 transitions. [2025-03-17 06:05:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:05:20,922 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-03-17 06:05:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:20,924 INFO L225 Difference]: With dead ends: 380 [2025-03-17 06:05:20,924 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 06:05:20,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:05:20,925 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 731 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:20,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 566 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 06:05:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 06:05:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 156. [2025-03-17 06:05:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.4028776978417266) internal successors, (195), 139 states have internal predecessors, (195), 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 06:05:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 225 transitions. [2025-03-17 06:05:20,941 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 225 transitions. Word has length 130 [2025-03-17 06:05:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:20,942 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 225 transitions. [2025-03-17 06:05:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 225 transitions. [2025-03-17 06:05:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:20,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:20,944 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:20,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:05:20,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1037035781, now seen corresponding path program 1 times [2025-03-17 06:05:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131207998] [2025-03-17 06:05:20,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:21,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:21,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:21,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:21,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:21,428 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 06:05:21,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131207998] [2025-03-17 06:05:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131207998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:21,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:21,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:05:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778293986] [2025-03-17 06:05:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:21,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:05:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:21,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:05:21,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:21,430 INFO L87 Difference]: Start difference. First operand 156 states and 225 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 06:05:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:21,481 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2025-03-17 06:05:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:05:21,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 130 [2025-03-17 06:05:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:21,487 INFO L225 Difference]: With dead ends: 309 [2025-03-17 06:05:21,487 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 06:05:21,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:21,492 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:21,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 06:05:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 06:05:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 137 states have (on average 1.364963503649635) internal successors, (187), 137 states have internal predecessors, (187), 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 06:05:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2025-03-17 06:05:21,539 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 130 [2025-03-17 06:05:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:21,540 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2025-03-17 06:05:21,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 06:05:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2025-03-17 06:05:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:21,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:21,541 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:21,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:05:21,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -353900295, now seen corresponding path program 1 times [2025-03-17 06:05:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828569329] [2025-03-17 06:05:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:21,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:21,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:21,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:05:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828569329] [2025-03-17 06:05:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828569329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953101831] [2025-03-17 06:05:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:25,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:25,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:05:25,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:05:25,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:25,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:25,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:25,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 06:05:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:26,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:27,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:27,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:27,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:28,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:05:28,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 06:05:28,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:05:28,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:05:28,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:05:28,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 06:05:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:05:29,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:05:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953101831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:30,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:05:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2025-03-17 06:05:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942051094] [2025-03-17 06:05:30,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:05:30,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:05:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:30,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:05:30,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:05:30,792 INFO L87 Difference]: Start difference. First operand 154 states and 217 transitions. Second operand has 19 states, 18 states have (on average 6.222222222222222) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 06:05:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:37,918 INFO L93 Difference]: Finished difference Result 482 states and 661 transitions. [2025-03-17 06:05:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 06:05:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.222222222222222) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) Word has length 130 [2025-03-17 06:05:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:37,924 INFO L225 Difference]: With dead ends: 482 [2025-03-17 06:05:37,924 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 06:05:37,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 06:05:37,926 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1060 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:37,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 737 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-17 06:05:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 06:05:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 279. [2025-03-17 06:05:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.3209876543209877) internal successors, (321), 246 states have internal predecessors, (321), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:05:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 381 transitions. [2025-03-17 06:05:37,982 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 381 transitions. Word has length 130 [2025-03-17 06:05:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 381 transitions. [2025-03-17 06:05:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.222222222222222) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 06:05:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 381 transitions. [2025-03-17 06:05:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:37,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:37,985 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:37,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:05:38,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:38,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash -550413800, now seen corresponding path program 1 times [2025-03-17 06:05:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:38,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542797021] [2025-03-17 06:05:38,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:38,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:38,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:38,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:38,521 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 06:05:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542797021] [2025-03-17 06:05:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542797021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:38,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:05:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858602214] [2025-03-17 06:05:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:38,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:05:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:38,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:05:38,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:05:38,527 INFO L87 Difference]: Start difference. First operand 279 states and 381 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 06:05:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:39,050 INFO L93 Difference]: Finished difference Result 640 states and 880 transitions. [2025-03-17 06:05:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:05:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 130 [2025-03-17 06:05:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:39,062 INFO L225 Difference]: With dead ends: 640 [2025-03-17 06:05:39,063 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 06:05:39,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:05:39,064 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 46 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:39,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 614 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:05:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 06:05:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 290. [2025-03-17 06:05:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 254 states have (on average 1.3228346456692914) internal successors, (336), 257 states have internal predecessors, (336), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:05:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2025-03-17 06:05:39,122 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 130 [2025-03-17 06:05:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:39,122 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2025-03-17 06:05:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 06:05:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2025-03-17 06:05:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:39,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:39,124 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:39,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:05:39,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2144115642, now seen corresponding path program 1 times [2025-03-17 06:05:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583340603] [2025-03-17 06:05:39,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:39,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:39,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:39,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:39,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:40,357 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 06:05:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583340603] [2025-03-17 06:05:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583340603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:05:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314307688] [2025-03-17 06:05:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:40,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:05:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:40,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:05:40,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:05:40,359 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:40,645 INFO L93 Difference]: Finished difference Result 769 states and 1053 transitions. [2025-03-17 06:05:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:05:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:40,650 INFO L225 Difference]: With dead ends: 769 [2025-03-17 06:05:40,650 INFO L226 Difference]: Without dead ends: 488 [2025-03-17 06:05:40,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:05:40,652 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 184 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:40,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 477 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:05:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-17 06:05:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 482. [2025-03-17 06:05:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 416 states have (on average 1.3076923076923077) internal successors, (544), 420 states have internal predecessors, (544), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 06:05:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2025-03-17 06:05:40,714 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 130 [2025-03-17 06:05:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:40,715 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2025-03-17 06:05:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2025-03-17 06:05:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:40,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:40,719 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:40,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:05:40,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 69761338, now seen corresponding path program 1 times [2025-03-17 06:05:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:40,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804817600] [2025-03-17 06:05:40,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:40,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:40,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:41,579 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 06:05:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804817600] [2025-03-17 06:05:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804817600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:41,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:05:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713530826] [2025-03-17 06:05:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:41,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:05:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:05:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:41,580 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:41,774 INFO L93 Difference]: Finished difference Result 1026 states and 1404 transitions. [2025-03-17 06:05:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:05:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:41,778 INFO L225 Difference]: With dead ends: 1026 [2025-03-17 06:05:41,778 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 06:05:41,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:05:41,780 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 85 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:41,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 427 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:05:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 06:05:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2025-03-17 06:05:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 468 states have (on average 1.3076923076923077) internal successors, (612), 471 states have internal predecessors, (612), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-17 06:05:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 750 transitions. [2025-03-17 06:05:41,839 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 750 transitions. Word has length 130 [2025-03-17 06:05:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:41,839 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 750 transitions. [2025-03-17 06:05:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 750 transitions. [2025-03-17 06:05:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:41,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:41,840 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:41,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:05:41,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2076168378, now seen corresponding path program 1 times [2025-03-17 06:05:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403587596] [2025-03-17 06:05:41,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:41,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:41,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:41,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:43,272 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 06:05:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403587596] [2025-03-17 06:05:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403587596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:05:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805303016] [2025-03-17 06:05:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:43,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:05:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:43,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:05:43,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:05:43,273 INFO L87 Difference]: Start difference. First operand 549 states and 750 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:44,349 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2025-03-17 06:05:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:05:44,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-03-17 06:05:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:44,354 INFO L225 Difference]: With dead ends: 1185 [2025-03-17 06:05:44,354 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 06:05:44,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:05:44,356 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:44,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 774 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:05:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 06:05:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 701. [2025-03-17 06:05:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 600 states have (on average 1.31) internal successors, (786), 604 states have internal predecessors, (786), 86 states have call successors, (86), 14 states have call predecessors, (86), 14 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 06:05:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 958 transitions. [2025-03-17 06:05:44,436 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 958 transitions. Word has length 130 [2025-03-17 06:05:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:44,436 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 958 transitions. [2025-03-17 06:05:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 958 transitions. [2025-03-17 06:05:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:05:44,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:44,438 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:05:44,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1863857658, now seen corresponding path program 1 times [2025-03-17 06:05:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717975332] [2025-03-17 06:05:44,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:44,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:05:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:05:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:45,995 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 06:05:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717975332] [2025-03-17 06:05:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717975332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:45,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:05:45,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350739867] [2025-03-17 06:05:45,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:05:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:45,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:05:45,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:05:45,997 INFO L87 Difference]: Start difference. First operand 701 states and 958 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:46,909 INFO L93 Difference]: Finished difference Result 1516 states and 2065 transitions. [2025-03-17 06:05:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:05:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-03-17 06:05:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:46,915 INFO L225 Difference]: With dead ends: 1516 [2025-03-17 06:05:46,915 INFO L226 Difference]: Without dead ends: 891 [2025-03-17 06:05:46,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:05:46,917 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 249 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:46,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 483 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:05:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-17 06:05:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 812. [2025-03-17 06:05:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 699 states have (on average 1.311874105865522) internal successors, (917), 707 states have internal predecessors, (917), 94 states have call successors, (94), 18 states have call predecessors, (94), 18 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 06:05:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1105 transitions. [2025-03-17 06:05:47,000 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1105 transitions. Word has length 130 [2025-03-17 06:05:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:47,000 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1105 transitions. [2025-03-17 06:05:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1105 transitions. [2025-03-17 06:05:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:05:47,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:47,004 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:05:47,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:47,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2072621440, now seen corresponding path program 1 times [2025-03-17 06:05:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557925494] [2025-03-17 06:05:47,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:47,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:05:47,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:05:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:47,124 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 06:05:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557925494] [2025-03-17 06:05:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557925494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:05:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539771691] [2025-03-17 06:05:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:05:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:05:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:47,127 INFO L87 Difference]: Start difference. First operand 812 states and 1105 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 06:05:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:47,195 INFO L93 Difference]: Finished difference Result 1149 states and 1565 transitions. [2025-03-17 06:05:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:05:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 131 [2025-03-17 06:05:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:47,200 INFO L225 Difference]: With dead ends: 1149 [2025-03-17 06:05:47,201 INFO L226 Difference]: Without dead ends: 812 [2025-03-17 06:05:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:47,202 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:47,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-17 06:05:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2025-03-17 06:05:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 699 states have (on average 1.3104434907010014) internal successors, (916), 707 states have internal predecessors, (916), 94 states have call successors, (94), 18 states have call predecessors, (94), 18 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 06:05:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1104 transitions. [2025-03-17 06:05:47,274 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1104 transitions. Word has length 131 [2025-03-17 06:05:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:47,275 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1104 transitions. [2025-03-17 06:05:47,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 06:05:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1104 transitions. [2025-03-17 06:05:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:05:47,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:47,276 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:05:47,276 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -977581375, now seen corresponding path program 1 times [2025-03-17 06:05:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:47,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515203110] [2025-03-17 06:05:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:47,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:05:47,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:05:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:48,271 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 06:05:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515203110] [2025-03-17 06:05:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515203110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:05:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882612677] [2025-03-17 06:05:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:48,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:05:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:48,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:05:48,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:05:48,276 INFO L87 Difference]: Start difference. First operand 812 states and 1104 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 06:05:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:49,310 INFO L93 Difference]: Finished difference Result 1250 states and 1699 transitions. [2025-03-17 06:05:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:05:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 131 [2025-03-17 06:05:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:49,315 INFO L225 Difference]: With dead ends: 1250 [2025-03-17 06:05:49,315 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 06:05:49,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:05:49,317 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 274 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:49,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1162 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:05:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 06:05:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 833. [2025-03-17 06:05:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 720 states have (on average 1.3125) internal successors, (945), 728 states have internal predecessors, (945), 94 states have call successors, (94), 18 states have call predecessors, (94), 18 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 06:05:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1133 transitions. [2025-03-17 06:05:49,395 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1133 transitions. Word has length 131 [2025-03-17 06:05:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1133 transitions. [2025-03-17 06:05:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 06:05:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1133 transitions. [2025-03-17 06:05:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:05:49,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:49,397 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:05:49,398 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 921048508, now seen corresponding path program 1 times [2025-03-17 06:05:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197277872] [2025-03-17 06:05:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:49,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:05:49,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:05:49,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:49,655 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 06:05:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197277872] [2025-03-17 06:05:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197277872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:49,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:49,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:05:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520466014] [2025-03-17 06:05:49,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:49,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:05:49,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:49,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:05:49,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:49,657 INFO L87 Difference]: Start difference. First operand 833 states and 1133 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 06:05:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:50,026 INFO L93 Difference]: Finished difference Result 1262 states and 1718 transitions. [2025-03-17 06:05:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:05:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 131 [2025-03-17 06:05:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:50,031 INFO L225 Difference]: With dead ends: 1262 [2025-03-17 06:05:50,031 INFO L226 Difference]: Without dead ends: 904 [2025-03-17 06:05:50,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:05:50,033 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:50,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 489 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:05:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-17 06:05:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 837. [2025-03-17 06:05:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 724 states have (on average 1.3121546961325967) internal successors, (950), 732 states have internal predecessors, (950), 94 states have call successors, (94), 18 states have call predecessors, (94), 18 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 06:05:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1138 transitions. [2025-03-17 06:05:50,121 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1138 transitions. Word has length 131 [2025-03-17 06:05:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:50,122 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1138 transitions. [2025-03-17 06:05:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 06:05:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1138 transitions. [2025-03-17 06:05:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:05:50,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:50,123 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:05:50,123 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -946561568, now seen corresponding path program 1 times [2025-03-17 06:05:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321594325] [2025-03-17 06:05:50,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:50,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:05:50,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:05:50,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:51,760 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 06:05:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:51,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321594325] [2025-03-17 06:05:51,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321594325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:51,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:05:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655530785] [2025-03-17 06:05:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:05:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:51,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:05:51,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:05:51,763 INFO L87 Difference]: Start difference. First operand 837 states and 1138 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:53,581 INFO L93 Difference]: Finished difference Result 1455 states and 1981 transitions. [2025-03-17 06:05:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:05:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-17 06:05:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:53,599 INFO L225 Difference]: With dead ends: 1455 [2025-03-17 06:05:53,600 INFO L226 Difference]: Without dead ends: 1093 [2025-03-17 06:05:53,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:05:53,602 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 272 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:53,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1419 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 06:05:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-03-17 06:05:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1041. [2025-03-17 06:05:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 906 states have (on average 1.3189845474613686) internal successors, (1195), 916 states have internal predecessors, (1195), 113 states have call successors, (113), 21 states have call predecessors, (113), 21 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 06:05:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1421 transitions. [2025-03-17 06:05:53,870 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1421 transitions. Word has length 131 [2025-03-17 06:05:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:53,871 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1421 transitions. [2025-03-17 06:05:53,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:05:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1421 transitions. [2025-03-17 06:05:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:05:53,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:53,874 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:53,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:05:53,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:53,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1413845910, now seen corresponding path program 1 times [2025-03-17 06:05:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855355900] [2025-03-17 06:05:53,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:53,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:05:54,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:05:54,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:55,506 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 06:05:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855355900] [2025-03-17 06:05:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855355900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:05:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405901590] [2025-03-17 06:05:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:05:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:05:55,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:05:55,510 INFO L87 Difference]: Start difference. First operand 1041 states and 1421 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:56,364 INFO L93 Difference]: Finished difference Result 1683 states and 2302 transitions. [2025-03-17 06:05:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:05:56,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2025-03-17 06:05:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:56,371 INFO L225 Difference]: With dead ends: 1683 [2025-03-17 06:05:56,371 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 06:05:56,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:05:56,377 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 458 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:56,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 415 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:05:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 06:05:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1033. [2025-03-17 06:05:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 898 states have (on average 1.3129175946547884) internal successors, (1179), 908 states have internal predecessors, (1179), 113 states have call successors, (113), 21 states have call predecessors, (113), 21 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 06:05:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1405 transitions. [2025-03-17 06:05:56,566 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1405 transitions. Word has length 132 [2025-03-17 06:05:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:56,566 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1405 transitions. [2025-03-17 06:05:56,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:05:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1405 transitions. [2025-03-17 06:05:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:05:56,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:56,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:56,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:05:56,568 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:56,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 416773557, now seen corresponding path program 1 times [2025-03-17 06:05:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242535005] [2025-03-17 06:05:56,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:56,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:05:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:05:56,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:56,791 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 06:05:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242535005] [2025-03-17 06:05:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242535005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:05:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849300185] [2025-03-17 06:05:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:05:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:56,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:05:56,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:05:56,816 INFO L87 Difference]: Start difference. First operand 1033 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (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 06:05:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:57,443 INFO L93 Difference]: Finished difference Result 1675 states and 2280 transitions. [2025-03-17 06:05:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:05:57,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (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 132 [2025-03-17 06:05:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:57,467 INFO L225 Difference]: With dead ends: 1675 [2025-03-17 06:05:57,472 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 06:05:57,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:05:57,474 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 92 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:57,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 438 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:05:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 06:05:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1033. [2025-03-17 06:05:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 898 states have (on average 1.3062360801781736) internal successors, (1173), 908 states have internal predecessors, (1173), 113 states have call successors, (113), 21 states have call predecessors, (113), 21 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 06:05:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1399 transitions. [2025-03-17 06:05:57,752 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1399 transitions. Word has length 132 [2025-03-17 06:05:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:57,753 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1399 transitions. [2025-03-17 06:05:57,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (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 06:05:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1399 transitions. [2025-03-17 06:05:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:05:57,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:57,757 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:05:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:05:57,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:57,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash -658728709, now seen corresponding path program 1 times [2025-03-17 06:05:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695101059] [2025-03-17 06:05:57,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:05:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:05:57,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:57,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:00,650 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 06:06:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695101059] [2025-03-17 06:06:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695101059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:00,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:06:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967849484] [2025-03-17 06:06:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:06:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:00,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:06:00,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:06:00,654 INFO L87 Difference]: Start difference. First operand 1033 states and 1399 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:06:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:01,919 INFO L93 Difference]: Finished difference Result 1457 states and 1969 transitions. [2025-03-17 06:06:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:06:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2025-03-17 06:06:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:01,926 INFO L225 Difference]: With dead ends: 1457 [2025-03-17 06:06:01,926 INFO L226 Difference]: Without dead ends: 1099 [2025-03-17 06:06:01,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:06:01,934 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 341 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:01,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 474 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:06:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-17 06:06:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1041. [2025-03-17 06:06:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 906 states have (on average 1.3057395143487858) internal successors, (1183), 916 states have internal predecessors, (1183), 113 states have call successors, (113), 21 states have call predecessors, (113), 21 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 06:06:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1409 transitions. [2025-03-17 06:06:02,105 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1409 transitions. Word has length 132 [2025-03-17 06:06:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1409 transitions. [2025-03-17 06:06:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:06:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1409 transitions. [2025-03-17 06:06:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:06:02,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:02,107 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:06:02,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:06:02,107 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash -855242214, now seen corresponding path program 1 times [2025-03-17 06:06:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:02,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123941440] [2025-03-17 06:06:02,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:02,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:06:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:06:02,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:02,645 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 06:06:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123941440] [2025-03-17 06:06:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123941440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:06:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183684449] [2025-03-17 06:06:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:06:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:02,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:06:02,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:06:02,648 INFO L87 Difference]: Start difference. First operand 1041 states and 1409 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 06:06:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:03,319 INFO L93 Difference]: Finished difference Result 1473 states and 1990 transitions. [2025-03-17 06:06:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:06:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 132 [2025-03-17 06:06:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:03,325 INFO L225 Difference]: With dead ends: 1473 [2025-03-17 06:06:03,326 INFO L226 Difference]: Without dead ends: 1107 [2025-03-17 06:06:03,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:06:03,327 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 190 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:03,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 644 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-17 06:06:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1057. [2025-03-17 06:06:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 922 states have (on average 1.306941431670282) internal successors, (1205), 932 states have internal predecessors, (1205), 113 states have call successors, (113), 21 states have call predecessors, (113), 21 states have return successors, (113), 103 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 06:06:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1431 transitions. [2025-03-17 06:06:03,546 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1431 transitions. Word has length 132 [2025-03-17 06:06:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1431 transitions. [2025-03-17 06:06:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 06:06:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1431 transitions. [2025-03-17 06:06:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:06:03,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:03,548 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:06:03,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:06:03,548 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1839287228, now seen corresponding path program 1 times [2025-03-17 06:06:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149824997] [2025-03-17 06:06:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:03,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:06:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:06:03,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:05,175 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 06:06:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149824997] [2025-03-17 06:06:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149824997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:06:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748101362] [2025-03-17 06:06:05,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:05,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:06:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:05,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:06:05,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:06:05,177 INFO L87 Difference]: Start difference. First operand 1057 states and 1431 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:06:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:05,645 INFO L93 Difference]: Finished difference Result 1746 states and 2360 transitions. [2025-03-17 06:06:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:05,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-17 06:06:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:05,656 INFO L225 Difference]: With dead ends: 1746 [2025-03-17 06:06:05,657 INFO L226 Difference]: Without dead ends: 1364 [2025-03-17 06:06:05,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:06:05,659 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 182 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:05,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 377 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-17 06:06:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1356. [2025-03-17 06:06:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1183 states have (on average 1.305156382079459) internal successors, (1544), 1197 states have internal predecessors, (1544), 145 states have call successors, (145), 27 states have call predecessors, (145), 27 states have return successors, (145), 131 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-17 06:06:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1834 transitions. [2025-03-17 06:06:05,840 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1834 transitions. Word has length 132 [2025-03-17 06:06:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:05,840 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1834 transitions. [2025-03-17 06:06:05,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:06:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1834 transitions. [2025-03-17 06:06:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:06:05,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:05,842 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:06:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:06:05,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1954025699, now seen corresponding path program 1 times [2025-03-17 06:06:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052185232] [2025-03-17 06:06:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:05,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:06:05,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:06:05,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:05,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:06,526 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 06:06:06,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052185232] [2025-03-17 06:06:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052185232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:06,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:06,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:06:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39392801] [2025-03-17 06:06:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:06,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:06:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:06,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:06:06,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:06:06,530 INFO L87 Difference]: Start difference. First operand 1356 states and 1834 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 06:06:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:07,200 INFO L93 Difference]: Finished difference Result 2115 states and 2857 transitions. [2025-03-17 06:06:07,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:06:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 132 [2025-03-17 06:06:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:07,208 INFO L225 Difference]: With dead ends: 2115 [2025-03-17 06:06:07,211 INFO L226 Difference]: Without dead ends: 1434 [2025-03-17 06:06:07,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:06:07,215 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 170 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:07,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 722 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-17 06:06:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1348. [2025-03-17 06:06:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1175 states have (on average 1.3046808510638297) internal successors, (1533), 1189 states have internal predecessors, (1533), 145 states have call successors, (145), 27 states have call predecessors, (145), 27 states have return successors, (145), 131 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-17 06:06:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1823 transitions. [2025-03-17 06:06:07,464 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1823 transitions. Word has length 132 [2025-03-17 06:06:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:07,464 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1823 transitions. [2025-03-17 06:06:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (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 06:06:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1823 transitions. [2025-03-17 06:06:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:06:07,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:07,472 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:06:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:06:07,472 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2144428092, now seen corresponding path program 1 times [2025-03-17 06:06:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117196371] [2025-03-17 06:06:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:07,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:06:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:06:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat