./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-p_file-32.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 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:38:20,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:38:20,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:38:20,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:38:20,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:38:20,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:38:20,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:38:20,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:38:20,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:38:20,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:38:20,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:38:20,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:38:20,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:38:20,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:38:20,239 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:38:20,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:38:20,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:38:20,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:38:20,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:38:20,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:38:20,241 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 -> 50aaa9c38941e3902867fed1ab11249c92826155dddcdcedd0a40439bce25b5e [2025-03-08 16:38:20,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:38:20,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:38:20,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:38:20,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:38:20,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:38:20,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2025-03-08 16:38:21,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a7f0f00/dba58f3d216647b6b4b0b7a6bd3a7b95/FLAGae001cd03 [2025-03-08 16:38:21,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:38:21,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-32.i [2025-03-08 16:38:21,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a7f0f00/dba58f3d216647b6b4b0b7a6bd3a7b95/FLAGae001cd03 [2025-03-08 16:38:22,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4a7f0f00/dba58f3d216647b6b4b0b7a6bd3a7b95 [2025-03-08 16:38:22,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:38:22,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:38:22,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:38:22,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:38:22,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:38:22,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258bccf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22, skipping insertion in model container [2025-03-08 16:38:22,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:38:22,288 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-p_file-32.i[916,929] [2025-03-08 16:38:22,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:38:22,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:38:22,342 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-p_file-32.i[916,929] [2025-03-08 16:38:22,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:38:22,374 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:38:22,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22 WrapperNode [2025-03-08 16:38:22,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:38:22,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:38:22,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:38:22,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:38:22,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,425 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2025-03-08 16:38:22,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:38:22,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:38:22,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:38:22,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:38:22,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,462 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 7, 18, 20, 8, 8, 12, 12, 8, 6, 7, 10, 6]. 16 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1]. [2025-03-08 16:38:22,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:38:22,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:38:22,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:38:22,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:38:22,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (1/1) ... [2025-03-08 16:38:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:38:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:38:22,528 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-08 16:38:22,530 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-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:38:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:38:22,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:38:22,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:38:22,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:38:22,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:38:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 16:38:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:38:22,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:38:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 16:38:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:38:22,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:38:22,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:38:22,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:38:22,941 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-08 16:38:22,967 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 16:38:22,967 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:38:22,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:38:22,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:38:22,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:38:22 BoogieIcfgContainer [2025-03-08 16:38:22,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:38:22,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:38:22,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:38:22,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:38:22,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:38:22" (1/3) ... [2025-03-08 16:38:22,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7424c833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:38:22, skipping insertion in model container [2025-03-08 16:38:22,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:38:22" (2/3) ... [2025-03-08 16:38:22,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7424c833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:38:22, skipping insertion in model container [2025-03-08 16:38:22,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:38:22" (3/3) ... [2025-03-08 16:38:22,981 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-32.i [2025-03-08 16:38:22,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:38:22,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:38:23,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:38:23,041 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;@123175a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:38:23,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:38:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:38:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:38:23,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:23,056 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:23,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:23,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2105035164, now seen corresponding path program 1 times [2025-03-08 16:38:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:23,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645409555] [2025-03-08 16:38:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:23,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:38:23,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:38:23,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:23,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:38:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645409555] [2025-03-08 16:38:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645409555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:38:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895718695] [2025-03-08 16:38:23,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:38:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:38:23,321 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-08 16:38:23,322 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-08 16:38:23,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:38:23,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:38:23,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:23,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:23,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:38:23,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:38:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:38:23,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:38:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895718695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:38:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:38:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788168541] [2025-03-08 16:38:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:23,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:38:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:23,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:38:23,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:38:23,559 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:38:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:23,586 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-08 16:38:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:38:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-08 16:38:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:23,592 INFO L225 Difference]: With dead ends: 190 [2025-03-08 16:38:23,593 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 16:38:23,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-08 16:38:23,599 INFO L435 NwaCegarLoop]: 132 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, 132 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-08 16:38:23,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:38:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 16:38:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 16:38:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:38:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-08 16:38:23,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-03-08 16:38:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:23,629 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-08 16:38:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:38:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-08 16:38:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:38:23,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:23,631 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:23,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:38:23,831 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-08 16:38:23,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1664571346, now seen corresponding path program 1 times [2025-03-08 16:38:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209973044] [2025-03-08 16:38:23,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:23,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:38:23,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:38:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:23,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209973044] [2025-03-08 16:38:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209973044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:24,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:38:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094042690] [2025-03-08 16:38:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:24,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:38:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:24,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:38:24,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:38:24,160 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:24,318 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-03-08 16:38:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:38:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-08 16:38:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:24,323 INFO L225 Difference]: With dead ends: 318 [2025-03-08 16:38:24,324 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 16:38:24,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:38:24,325 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:24,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 368 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:38:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 16:38:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-03-08 16:38:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:38:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-03-08 16:38:24,351 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-03-08 16:38:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:24,353 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-03-08 16:38:24,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-03-08 16:38:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:38:24,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:24,357 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:38:24,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -172875070, now seen corresponding path program 1 times [2025-03-08 16:38:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110220192] [2025-03-08 16:38:24,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:24,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:38:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:38:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110220192] [2025-03-08 16:38:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110220192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:38:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498000517] [2025-03-08 16:38:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:25,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:38:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:25,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:38:25,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:38:25,148 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:25,373 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2025-03-08 16:38:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:38:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-03-08 16:38:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:25,375 INFO L225 Difference]: With dead ends: 511 [2025-03-08 16:38:25,375 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 16:38:25,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:38:25,377 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:25,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1088 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:38:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 16:38:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2025-03-08 16:38:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 441 transitions. [2025-03-08 16:38:25,401 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 441 transitions. Word has length 137 [2025-03-08 16:38:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:25,402 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 441 transitions. [2025-03-08 16:38:25,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 441 transitions. [2025-03-08 16:38:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:38:25,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:25,405 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:38:25,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -133359771, now seen corresponding path program 1 times [2025-03-08 16:38:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000182370] [2025-03-08 16:38:25,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:25,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:38:25,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:38:25,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:26,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000182370] [2025-03-08 16:38:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000182370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:38:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014140063] [2025-03-08 16:38:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:38:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:26,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:38:26,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:38:26,382 INFO L87 Difference]: Start difference. First operand 317 states and 441 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:27,317 INFO L93 Difference]: Finished difference Result 675 states and 933 transitions. [2025-03-08 16:38:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:38:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-08 16:38:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:27,320 INFO L225 Difference]: With dead ends: 675 [2025-03-08 16:38:27,320 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 16:38:27,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:38:27,322 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 270 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:27,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1335 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:38:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 16:38:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 317. [2025-03-08 16:38:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 270 states have internal predecessors, (352), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 440 transitions. [2025-03-08 16:38:27,341 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 440 transitions. Word has length 139 [2025-03-08 16:38:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 440 transitions. [2025-03-08 16:38:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 440 transitions. [2025-03-08 16:38:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:38:27,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:27,342 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:38:27,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1917836731, now seen corresponding path program 1 times [2025-03-08 16:38:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743613255] [2025-03-08 16:38:27,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:27,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:38:27,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:38:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743613255] [2025-03-08 16:38:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743613255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:38:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194074140] [2025-03-08 16:38:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:28,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:38:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:28,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:38:28,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:38:28,153 INFO L87 Difference]: Start difference. First operand 317 states and 440 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:28,888 INFO L93 Difference]: Finished difference Result 669 states and 922 transitions. [2025-03-08 16:38:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:38:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 139 [2025-03-08 16:38:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:28,892 INFO L225 Difference]: With dead ends: 669 [2025-03-08 16:38:28,893 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 16:38:28,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:38:28,895 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 604 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:28,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 828 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:38:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 16:38:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 322. [2025-03-08 16:38:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.3076923076923077) internal successors, (357), 275 states have internal predecessors, (357), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2025-03-08 16:38:28,919 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 139 [2025-03-08 16:38:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:28,921 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2025-03-08 16:38:28,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2025-03-08 16:38:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:38:28,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:28,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:38:28,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -391010055, now seen corresponding path program 1 times [2025-03-08 16:38:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595300237] [2025-03-08 16:38:28,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:28,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:38:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:38:28,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:28,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:38:29,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595300237] [2025-03-08 16:38:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595300237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:38:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392685964] [2025-03-08 16:38:29,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:38:29,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:38:29,063 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-08 16:38:29,065 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-08 16:38:29,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:38:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:38:29,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:29,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:29,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:38:29,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:38:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:29,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:38:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392685964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:38:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:38:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771715946] [2025-03-08 16:38:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:29,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:38:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:29,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:38:29,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:38:29,238 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:29,269 INFO L93 Difference]: Finished difference Result 653 states and 903 transitions. [2025-03-08 16:38:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:38:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-08 16:38:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:29,271 INFO L225 Difference]: With dead ends: 653 [2025-03-08 16:38:29,271 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 16:38:29,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:38:29,272 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:29,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:38:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 16:38:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-08 16:38:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 285 states have (on average 1.2947368421052632) internal successors, (369), 287 states have internal predecessors, (369), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 457 transitions. [2025-03-08 16:38:29,300 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 457 transitions. Word has length 139 [2025-03-08 16:38:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 457 transitions. [2025-03-08 16:38:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 457 transitions. [2025-03-08 16:38:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:38:29,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:29,302 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:29,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:38:29,502 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,SelfDestructingSolverStorable5 [2025-03-08 16:38:29,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:29,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 7464510, now seen corresponding path program 1 times [2025-03-08 16:38:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343909235] [2025-03-08 16:38:29,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:29,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:38:29,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:38:29,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:29,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343909235] [2025-03-08 16:38:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343909235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:38:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754746031] [2025-03-08 16:38:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:30,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:38:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:30,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:38:30,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:38:30,133 INFO L87 Difference]: Start difference. First operand 334 states and 457 transitions. Second operand has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:38:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:30,802 INFO L93 Difference]: Finished difference Result 546 states and 748 transitions. [2025-03-08 16:38:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:38:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 140 [2025-03-08 16:38:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:30,807 INFO L225 Difference]: With dead ends: 546 [2025-03-08 16:38:30,808 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 16:38:30,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:38:30,809 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 284 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:30,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1143 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:38:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 16:38:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 349. [2025-03-08 16:38:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 300 states have (on average 1.3066666666666666) internal successors, (392), 302 states have internal predecessors, (392), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 480 transitions. [2025-03-08 16:38:30,836 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 480 transitions. Word has length 140 [2025-03-08 16:38:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 480 transitions. [2025-03-08 16:38:30,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:38:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 480 transitions. [2025-03-08 16:38:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:38:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:30,838 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:38:30,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash -789425596, now seen corresponding path program 1 times [2025-03-08 16:38:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:30,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167326400] [2025-03-08 16:38:30,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:30,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:38:30,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:38:30,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:30,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167326400] [2025-03-08 16:38:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167326400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:38:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286729967] [2025-03-08 16:38:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:31,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:38:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:31,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:38:31,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:38:31,610 INFO L87 Difference]: Start difference. First operand 349 states and 480 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:32,198 INFO L93 Difference]: Finished difference Result 689 states and 948 transitions. [2025-03-08 16:38:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:38:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 140 [2025-03-08 16:38:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:32,200 INFO L225 Difference]: With dead ends: 689 [2025-03-08 16:38:32,200 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 16:38:32,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:38:32,201 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 419 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:32,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 738 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:38:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 16:38:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2025-03-08 16:38:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 285 states have (on average 1.3087719298245615) internal successors, (373), 287 states have internal predecessors, (373), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 461 transitions. [2025-03-08 16:38:32,225 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 461 transitions. Word has length 140 [2025-03-08 16:38:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 461 transitions. [2025-03-08 16:38:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 461 transitions. [2025-03-08 16:38:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:38:32,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:32,227 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:38:32,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1696627240, now seen corresponding path program 1 times [2025-03-08 16:38:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102740396] [2025-03-08 16:38:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:32,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:38:32,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:38:32,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:32,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:32,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:32,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102740396] [2025-03-08 16:38:32,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102740396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:32,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:38:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637401623] [2025-03-08 16:38:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:32,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:38:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:32,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:38:32,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:38:32,704 INFO L87 Difference]: Start difference. First operand 334 states and 461 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:33,173 INFO L93 Difference]: Finished difference Result 787 states and 1078 transitions. [2025-03-08 16:38:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:38:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-08 16:38:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:33,176 INFO L225 Difference]: With dead ends: 787 [2025-03-08 16:38:33,176 INFO L226 Difference]: Without dead ends: 456 [2025-03-08 16:38:33,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:38:33,177 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 111 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:33,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1808 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:38:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-08 16:38:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 364. [2025-03-08 16:38:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 315 states have (on average 1.307936507936508) internal successors, (412), 317 states have internal predecessors, (412), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:38:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 500 transitions. [2025-03-08 16:38:33,196 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 500 transitions. Word has length 141 [2025-03-08 16:38:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 500 transitions. [2025-03-08 16:38:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 500 transitions. [2025-03-08 16:38:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:38:33,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:33,198 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:38:33,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 189013819, now seen corresponding path program 1 times [2025-03-08 16:38:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193714442] [2025-03-08 16:38:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:38:33,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:38:33,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:33,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193714442] [2025-03-08 16:38:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193714442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:38:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585992327] [2025-03-08 16:38:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:33,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:38:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:33,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:38:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:38:33,504 INFO L87 Difference]: Start difference. First operand 364 states and 500 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:33,745 INFO L93 Difference]: Finished difference Result 1016 states and 1385 transitions. [2025-03-08 16:38:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:38:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-08 16:38:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:33,749 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 16:38:33,749 INFO L226 Difference]: Without dead ends: 655 [2025-03-08 16:38:33,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:38:33,750 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 236 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:33,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 623 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-08 16:38:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 632. [2025-03-08 16:38:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 529 states have (on average 1.281663516068053) internal successors, (678), 534 states have internal predecessors, (678), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:38:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 862 transitions. [2025-03-08 16:38:33,788 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 862 transitions. Word has length 141 [2025-03-08 16:38:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:33,789 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 862 transitions. [2025-03-08 16:38:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 862 transitions. [2025-03-08 16:38:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:38:33,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:33,790 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:38:33,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:33,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1656351597, now seen corresponding path program 1 times [2025-03-08 16:38:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635791228] [2025-03-08 16:38:33,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:38:33,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:38:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635791228] [2025-03-08 16:38:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635791228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 16:38:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057229754] [2025-03-08 16:38:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 16:38:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:34,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 16:38:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:38:34,911 INFO L87 Difference]: Start difference. First operand 632 states and 862 transitions. Second operand has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 16:38:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:36,309 INFO L93 Difference]: Finished difference Result 1099 states and 1444 transitions. [2025-03-08 16:38:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 16:38:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 141 [2025-03-08 16:38:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:36,315 INFO L225 Difference]: With dead ends: 1099 [2025-03-08 16:38:36,315 INFO L226 Difference]: Without dead ends: 1097 [2025-03-08 16:38:36,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=482, Invalid=2598, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 16:38:36,317 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 706 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1154 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:38:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-03-08 16:38:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 876. [2025-03-08 16:38:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 759 states have (on average 1.2582345191040842) internal successors, (955), 766 states have internal predecessors, (955), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 97 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 16:38:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1163 transitions. [2025-03-08 16:38:36,366 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1163 transitions. Word has length 141 [2025-03-08 16:38:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:36,366 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1163 transitions. [2025-03-08 16:38:36,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 16:38:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1163 transitions. [2025-03-08 16:38:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:38:36,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:36,368 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:36,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:38:36,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:36,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash -410192191, now seen corresponding path program 1 times [2025-03-08 16:38:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616892429] [2025-03-08 16:38:36,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:36,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:38:36,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:38:36,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:36,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616892429] [2025-03-08 16:38:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616892429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:38:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546101341] [2025-03-08 16:38:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:36,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:38:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:36,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:38:36,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:38:36,790 INFO L87 Difference]: Start difference. First operand 876 states and 1163 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:37,151 INFO L93 Difference]: Finished difference Result 1827 states and 2420 transitions. [2025-03-08 16:38:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:38:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-08 16:38:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:37,157 INFO L225 Difference]: With dead ends: 1827 [2025-03-08 16:38:37,157 INFO L226 Difference]: Without dead ends: 954 [2025-03-08 16:38:37,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:38:37,160 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 57 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:37,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1604 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-08 16:38:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 834. [2025-03-08 16:38:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 717 states have (on average 1.2566248256624826) internal successors, (901), 724 states have internal predecessors, (901), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 97 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 16:38:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1109 transitions. [2025-03-08 16:38:37,200 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1109 transitions. Word has length 142 [2025-03-08 16:38:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1109 transitions. [2025-03-08 16:38:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1109 transitions. [2025-03-08 16:38:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:38:37,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:37,201 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:38:37,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2034611334, now seen corresponding path program 1 times [2025-03-08 16:38:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615776619] [2025-03-08 16:38:37,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:37,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:38:37,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:38:37,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:37,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615776619] [2025-03-08 16:38:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615776619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:37,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:37,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:38:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056485887] [2025-03-08 16:38:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:38:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:37,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:38:37,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:38:37,454 INFO L87 Difference]: Start difference. First operand 834 states and 1109 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:37,591 INFO L93 Difference]: Finished difference Result 1731 states and 2304 transitions. [2025-03-08 16:38:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:38:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-08 16:38:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:37,596 INFO L225 Difference]: With dead ends: 1731 [2025-03-08 16:38:37,596 INFO L226 Difference]: Without dead ends: 1238 [2025-03-08 16:38:37,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:38:37,598 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 74 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:37,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1028 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:38:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-03-08 16:38:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1216. [2025-03-08 16:38:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1057 states have (on average 1.2630085146641439) internal successors, (1335), 1070 states have internal predecessors, (1335), 140 states have call successors, (140), 18 states have call predecessors, (140), 18 states have return successors, (140), 127 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 16:38:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1615 transitions. [2025-03-08 16:38:37,652 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1615 transitions. Word has length 142 [2025-03-08 16:38:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:37,653 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1615 transitions. [2025-03-08 16:38:37,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1615 transitions. [2025-03-08 16:38:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:38:37,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:37,656 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:37,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:38:37,656 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:37,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1598453992, now seen corresponding path program 1 times [2025-03-08 16:38:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:37,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335781163] [2025-03-08 16:38:37,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:37,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:38:37,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:38:37,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:37,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335781163] [2025-03-08 16:38:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335781163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:38:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935839418] [2025-03-08 16:38:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:38:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:38:37,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:38:37,762 INFO L87 Difference]: Start difference. First operand 1216 states and 1615 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:37,872 INFO L93 Difference]: Finished difference Result 2831 states and 3746 transitions. [2025-03-08 16:38:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:38:37,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-08 16:38:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:37,878 INFO L225 Difference]: With dead ends: 2831 [2025-03-08 16:38:37,878 INFO L226 Difference]: Without dead ends: 1618 [2025-03-08 16:38:37,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:38:37,881 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 79 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:37,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 612 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:38:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-08 16:38:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1612. [2025-03-08 16:38:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1387 states have (on average 1.2451333813987022) internal successors, (1727), 1407 states have internal predecessors, (1727), 196 states have call successors, (196), 28 states have call predecessors, (196), 28 states have return successors, (196), 176 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 16:38:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2119 transitions. [2025-03-08 16:38:37,951 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2119 transitions. Word has length 143 [2025-03-08 16:38:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:37,951 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2119 transitions. [2025-03-08 16:38:37,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2119 transitions. [2025-03-08 16:38:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:38:37,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:37,954 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:38:37,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 858145130, now seen corresponding path program 1 times [2025-03-08 16:38:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031262026] [2025-03-08 16:38:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:37,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:38:38,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:38:38,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:38,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031262026] [2025-03-08 16:38:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031262026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:38,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:38:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520942459] [2025-03-08 16:38:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:38,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:38:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:38,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:38:38,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:38:38,613 INFO L87 Difference]: Start difference. First operand 1612 states and 2119 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:39,239 INFO L93 Difference]: Finished difference Result 3281 states and 4303 transitions. [2025-03-08 16:38:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:38:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2025-03-08 16:38:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:39,246 INFO L225 Difference]: With dead ends: 3281 [2025-03-08 16:38:39,247 INFO L226 Difference]: Without dead ends: 1672 [2025-03-08 16:38:39,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:38:39,251 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 404 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:39,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1071 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:38:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-03-08 16:38:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1638. [2025-03-08 16:38:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1413 states have (on average 1.2413305024769994) internal successors, (1754), 1433 states have internal predecessors, (1754), 196 states have call successors, (196), 28 states have call predecessors, (196), 28 states have return successors, (196), 176 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 16:38:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2146 transitions. [2025-03-08 16:38:39,323 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2146 transitions. Word has length 143 [2025-03-08 16:38:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2146 transitions. [2025-03-08 16:38:39,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2146 transitions. [2025-03-08 16:38:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:38:39,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:39,325 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:38:39,326 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 44770301, now seen corresponding path program 1 times [2025-03-08 16:38:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588957806] [2025-03-08 16:38:39,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:39,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:38:39,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:38:39,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:39,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588957806] [2025-03-08 16:38:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588957806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:38:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822785440] [2025-03-08 16:38:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:38:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:39,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:38:39,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:38:39,430 INFO L87 Difference]: Start difference. First operand 1638 states and 2146 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:39,539 INFO L93 Difference]: Finished difference Result 2724 states and 3575 transitions. [2025-03-08 16:38:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:38:39,540 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-08 16:38:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:39,545 INFO L225 Difference]: With dead ends: 2724 [2025-03-08 16:38:39,545 INFO L226 Difference]: Without dead ends: 1630 [2025-03-08 16:38:39,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:38:39,548 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 73 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:39,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 699 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:38:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-03-08 16:38:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1626. [2025-03-08 16:38:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1395 states have (on average 1.2344086021505376) internal successors, (1722), 1415 states have internal predecessors, (1722), 200 states have call successors, (200), 30 states have call predecessors, (200), 30 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 16:38:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2122 transitions. [2025-03-08 16:38:39,634 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2122 transitions. Word has length 144 [2025-03-08 16:38:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:39,634 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2122 transitions. [2025-03-08 16:38:39,634 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2122 transitions. [2025-03-08 16:38:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:38:39,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:39,636 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:39,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:38:39,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1446880791, now seen corresponding path program 1 times [2025-03-08 16:38:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605459220] [2025-03-08 16:38:39,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:38:39,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:38:39,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:39,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605459220] [2025-03-08 16:38:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605459220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:38:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387985902] [2025-03-08 16:38:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:38:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:40,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:38:40,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:38:40,141 INFO L87 Difference]: Start difference. First operand 1626 states and 2122 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:40,657 INFO L93 Difference]: Finished difference Result 3686 states and 4792 transitions. [2025-03-08 16:38:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:38:40,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-08 16:38:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:40,666 INFO L225 Difference]: With dead ends: 3686 [2025-03-08 16:38:40,666 INFO L226 Difference]: Without dead ends: 2063 [2025-03-08 16:38:40,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:38:40,669 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 286 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:40,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 753 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:38:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-08 16:38:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1890. [2025-03-08 16:38:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1659 states have (on average 1.2284508740204942) internal successors, (2038), 1679 states have internal predecessors, (2038), 200 states have call successors, (200), 30 states have call predecessors, (200), 30 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 16:38:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2438 transitions. [2025-03-08 16:38:40,791 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2438 transitions. Word has length 144 [2025-03-08 16:38:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:40,792 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2438 transitions. [2025-03-08 16:38:40,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2438 transitions. [2025-03-08 16:38:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:38:40,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:40,795 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:40,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:38:40,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:40,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2050012873, now seen corresponding path program 1 times [2025-03-08 16:38:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142766546] [2025-03-08 16:38:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:40,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:38:40,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:38:40,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:40,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:41,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142766546] [2025-03-08 16:38:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142766546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:41,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:38:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15753623] [2025-03-08 16:38:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:41,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:38:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:41,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:38:41,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:38:41,079 INFO L87 Difference]: Start difference. First operand 1890 states and 2438 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:41,386 INFO L93 Difference]: Finished difference Result 3820 states and 4927 transitions. [2025-03-08 16:38:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:38:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-08 16:38:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:41,394 INFO L225 Difference]: With dead ends: 3820 [2025-03-08 16:38:41,394 INFO L226 Difference]: Without dead ends: 1933 [2025-03-08 16:38:41,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:38:41,397 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 250 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:41,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 536 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-03-08 16:38:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1600. [2025-03-08 16:38:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1369 states have (on average 1.2286340394448503) internal successors, (1682), 1389 states have internal predecessors, (1682), 200 states have call successors, (200), 30 states have call predecessors, (200), 30 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 16:38:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2082 transitions. [2025-03-08 16:38:41,468 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2082 transitions. Word has length 144 [2025-03-08 16:38:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:41,468 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2082 transitions. [2025-03-08 16:38:41,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:38:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2082 transitions. [2025-03-08 16:38:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:38:41,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:41,470 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:41,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:38:41,470 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash -481537119, now seen corresponding path program 1 times [2025-03-08 16:38:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147114675] [2025-03-08 16:38:41,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:38:41,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:38:41,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147114675] [2025-03-08 16:38:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147114675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:38:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691346463] [2025-03-08 16:38:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:38:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:41,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:38:41,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:38:41,753 INFO L87 Difference]: Start difference. First operand 1600 states and 2082 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:42,020 INFO L93 Difference]: Finished difference Result 3205 states and 4160 transitions. [2025-03-08 16:38:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:38:42,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-08 16:38:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:42,026 INFO L225 Difference]: With dead ends: 3205 [2025-03-08 16:38:42,026 INFO L226 Difference]: Without dead ends: 1608 [2025-03-08 16:38:42,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:38:42,028 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 209 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:42,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 445 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-03-08 16:38:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1147. [2025-03-08 16:38:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 998 states have (on average 1.222444889779559) internal successors, (1220), 1012 states have internal predecessors, (1220), 126 states have call successors, (126), 22 states have call predecessors, (126), 22 states have return successors, (126), 112 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 16:38:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1472 transitions. [2025-03-08 16:38:42,084 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1472 transitions. Word has length 145 [2025-03-08 16:38:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:42,085 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1472 transitions. [2025-03-08 16:38:42,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1472 transitions. [2025-03-08 16:38:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:38:42,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:42,086 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:42,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:38:42,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:42,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1714819045, now seen corresponding path program 1 times [2025-03-08 16:38:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201282838] [2025-03-08 16:38:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:38:42,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:38:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:42,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:38:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201282838] [2025-03-08 16:38:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201282838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:38:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651616561] [2025-03-08 16:38:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:42,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:38:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:38:42,570 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-08 16:38:42,572 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-08 16:38:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:38:42,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:38:42,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:42,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:42,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:38:42,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:38:42,889 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-08 16:38:43,035 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 17 treesize of output 13 [2025-03-08 16:38:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 11 proven. 336 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 16:38:43,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:38:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651616561] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:38:43,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:38:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 15] total 22 [2025-03-08 16:38:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538774469] [2025-03-08 16:38:43,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:43,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:38:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:43,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:38:43,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:38:43,241 INFO L87 Difference]: Start difference. First operand 1147 states and 1472 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:43,421 INFO L93 Difference]: Finished difference Result 2584 states and 3311 transitions. [2025-03-08 16:38:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:38:43,422 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:38:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:43,428 INFO L225 Difference]: With dead ends: 2584 [2025-03-08 16:38:43,428 INFO L226 Difference]: Without dead ends: 1440 [2025-03-08 16:38:43,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 281 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:38:43,432 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 64 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:43,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1192 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:38:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-08 16:38:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1263. [2025-03-08 16:38:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1114 states have (on average 1.227109515260323) internal successors, (1367), 1128 states have internal predecessors, (1367), 126 states have call successors, (126), 22 states have call predecessors, (126), 22 states have return successors, (126), 112 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 16:38:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1619 transitions. [2025-03-08 16:38:43,502 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1619 transitions. Word has length 145 [2025-03-08 16:38:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:43,502 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1619 transitions. [2025-03-08 16:38:43,503 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1619 transitions. [2025-03-08 16:38:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:38:43,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:43,504 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:43,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:38:43,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:38:43,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -470054564, now seen corresponding path program 1 times [2025-03-08 16:38:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234199363] [2025-03-08 16:38:43,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:38:43,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:38:43,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234199363] [2025-03-08 16:38:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234199363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:38:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044850598] [2025-03-08 16:38:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:38:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:43,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:38:43,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:38:43,800 INFO L87 Difference]: Start difference. First operand 1263 states and 1619 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:43,903 INFO L93 Difference]: Finished difference Result 2593 states and 3322 transitions. [2025-03-08 16:38:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:38:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:38:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:43,909 INFO L225 Difference]: With dead ends: 2593 [2025-03-08 16:38:43,909 INFO L226 Difference]: Without dead ends: 1333 [2025-03-08 16:38:43,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:38:43,911 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 82 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:43,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 617 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:38:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-08 16:38:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1329. [2025-03-08 16:38:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1157 states have (on average 1.216076058772688) internal successors, (1407), 1173 states have internal predecessors, (1407), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 16:38:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1695 transitions. [2025-03-08 16:38:43,970 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1695 transitions. Word has length 145 [2025-03-08 16:38:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:43,970 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1695 transitions. [2025-03-08 16:38:43,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1695 transitions. [2025-03-08 16:38:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:38:43,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:43,971 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:43,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:38:43,971 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:43,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 773801681, now seen corresponding path program 1 times [2025-03-08 16:38:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225793320] [2025-03-08 16:38:43,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:38:44,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:38:44,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:44,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:44,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:44,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225793320] [2025-03-08 16:38:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225793320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:44,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:38:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193075990] [2025-03-08 16:38:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:44,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:38:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:44,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:38:44,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:38:44,403 INFO L87 Difference]: Start difference. First operand 1329 states and 1695 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:44,793 INFO L93 Difference]: Finished difference Result 2629 states and 3340 transitions. [2025-03-08 16:38:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:38:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 145 [2025-03-08 16:38:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:44,798 INFO L225 Difference]: With dead ends: 2629 [2025-03-08 16:38:44,798 INFO L226 Difference]: Without dead ends: 1303 [2025-03-08 16:38:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:38:44,801 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 300 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 505 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-08 16:38:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1275. [2025-03-08 16:38:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1103 states have (on average 1.1958295557570262) internal successors, (1319), 1119 states have internal predecessors, (1319), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 16:38:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1607 transitions. [2025-03-08 16:38:44,909 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1607 transitions. Word has length 145 [2025-03-08 16:38:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:44,910 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1607 transitions. [2025-03-08 16:38:44,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1607 transitions. [2025-03-08 16:38:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:38:44,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:44,912 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:44,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:38:44,912 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1538894258, now seen corresponding path program 1 times [2025-03-08 16:38:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638449966] [2025-03-08 16:38:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:44,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:38:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:38:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638449966] [2025-03-08 16:38:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638449966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:45,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:38:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997338714] [2025-03-08 16:38:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:38:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:45,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:38:45,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:38:45,342 INFO L87 Difference]: Start difference. First operand 1275 states and 1607 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:45,794 INFO L93 Difference]: Finished difference Result 2303 states and 2832 transitions. [2025-03-08 16:38:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:38:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-08 16:38:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:45,800 INFO L225 Difference]: With dead ends: 2303 [2025-03-08 16:38:45,801 INFO L226 Difference]: Without dead ends: 2301 [2025-03-08 16:38:45,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 16:38:45,802 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 270 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:45,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1215 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:38:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2025-03-08 16:38:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 1599. [2025-03-08 16:38:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1427 states have (on average 1.1920112123335669) internal successors, (1701), 1443 states have internal predecessors, (1701), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 16:38:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 1989 transitions. [2025-03-08 16:38:45,863 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 1989 transitions. Word has length 147 [2025-03-08 16:38:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:45,863 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 1989 transitions. [2025-03-08 16:38:45,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:38:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1989 transitions. [2025-03-08 16:38:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:38:45,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:45,865 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:45,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:38:45,865 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1752543954, now seen corresponding path program 1 times [2025-03-08 16:38:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558889391] [2025-03-08 16:38:45,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:38:45,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:38:45,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:45,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558889391] [2025-03-08 16:38:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558889391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 16:38:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194162924] [2025-03-08 16:38:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:46,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:38:46,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:46,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:38:46,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:38:46,644 INFO L87 Difference]: Start difference. First operand 1599 states and 1989 transitions. Second operand has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:48,211 INFO L93 Difference]: Finished difference Result 3300 states and 4089 transitions. [2025-03-08 16:38:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:38:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 147 [2025-03-08 16:38:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:48,225 INFO L225 Difference]: With dead ends: 3300 [2025-03-08 16:38:48,225 INFO L226 Difference]: Without dead ends: 1704 [2025-03-08 16:38:48,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 16:38:48,231 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 622 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:48,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1175 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:38:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-03-08 16:38:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1635. [2025-03-08 16:38:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1463 states have (on average 1.1872863978127135) internal successors, (1737), 1479 states have internal predecessors, (1737), 144 states have call successors, (144), 27 states have call predecessors, (144), 27 states have return successors, (144), 128 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 16:38:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2025 transitions. [2025-03-08 16:38:48,299 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2025 transitions. Word has length 147 [2025-03-08 16:38:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2025 transitions. [2025-03-08 16:38:48,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:38:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2025 transitions. [2025-03-08 16:38:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:38:48,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:48,300 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:38:48,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash -294129777, now seen corresponding path program 1 times [2025-03-08 16:38:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215656240] [2025-03-08 16:38:48,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:48,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:38:48,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:38:48,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215656240] [2025-03-08 16:38:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215656240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:38:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399827507] [2025-03-08 16:38:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:38:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:38:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:38:48,397 INFO L87 Difference]: Start difference. First operand 1635 states and 2025 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:48,559 INFO L93 Difference]: Finished difference Result 3979 states and 4914 transitions. [2025-03-08 16:38:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:38:48,560 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:38:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:48,567 INFO L225 Difference]: With dead ends: 3979 [2025-03-08 16:38:48,567 INFO L226 Difference]: Without dead ends: 2347 [2025-03-08 16:38:48,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:38:48,570 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 64 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:48,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 584 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:38:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2025-03-08 16:38:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1948. [2025-03-08 16:38:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1756 states have (on average 1.180523917995444) internal successors, (2073), 1774 states have internal predecessors, (2073), 160 states have call successors, (160), 31 states have call predecessors, (160), 31 states have return successors, (160), 142 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-08 16:38:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2393 transitions. [2025-03-08 16:38:48,644 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2393 transitions. Word has length 147 [2025-03-08 16:38:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:48,645 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2393 transitions. [2025-03-08 16:38:48,645 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2393 transitions. [2025-03-08 16:38:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:38:48,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:48,646 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:38:48,647 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1975290927, now seen corresponding path program 1 times [2025-03-08 16:38:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384310513] [2025-03-08 16:38:48,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:48,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:38:48,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:38:48,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384310513] [2025-03-08 16:38:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384310513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:38:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108225418] [2025-03-08 16:38:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:38:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:49,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:38:49,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:38:49,556 INFO L87 Difference]: Start difference. First operand 1948 states and 2393 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:38:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:50,936 INFO L93 Difference]: Finished difference Result 3975 states and 4869 transitions. [2025-03-08 16:38:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:38:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 148 [2025-03-08 16:38:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:50,941 INFO L225 Difference]: With dead ends: 3975 [2025-03-08 16:38:50,941 INFO L226 Difference]: Without dead ends: 2030 [2025-03-08 16:38:50,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 16:38:50,944 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 525 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:50,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1385 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:38:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-03-08 16:38:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1948. [2025-03-08 16:38:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1756 states have (on average 1.1765375854214124) internal successors, (2066), 1774 states have internal predecessors, (2066), 160 states have call successors, (160), 31 states have call predecessors, (160), 31 states have return successors, (160), 142 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-08 16:38:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2386 transitions. [2025-03-08 16:38:51,020 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2386 transitions. Word has length 148 [2025-03-08 16:38:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:51,020 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2386 transitions. [2025-03-08 16:38:51,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:38:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2386 transitions. [2025-03-08 16:38:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:38:51,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:51,022 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:51,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:38:51,022 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -867630035, now seen corresponding path program 1 times [2025-03-08 16:38:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63171613] [2025-03-08 16:38:51,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:51,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:38:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:38:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:38:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:38:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:38:51,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63171613] [2025-03-08 16:38:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63171613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:38:51,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:38:51,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:38:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415777923] [2025-03-08 16:38:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:38:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:38:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:38:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:38:51,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:38:51,426 INFO L87 Difference]: Start difference. First operand 1948 states and 2386 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:38:52,064 INFO L93 Difference]: Finished difference Result 5266 states and 6506 transitions. [2025-03-08 16:38:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:38:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-03-08 16:38:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:38:52,071 INFO L225 Difference]: With dead ends: 5266 [2025-03-08 16:38:52,071 INFO L226 Difference]: Without dead ends: 3321 [2025-03-08 16:38:52,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:38:52,074 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 292 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:38:52,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1067 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:38:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2025-03-08 16:38:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3180. [2025-03-08 16:38:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 2827 states have (on average 1.187831623629289) internal successors, (3358), 2856 states have internal predecessors, (3358), 296 states have call successors, (296), 56 states have call predecessors, (296), 56 states have return successors, (296), 267 states have call predecessors, (296), 296 states have call successors, (296) [2025-03-08 16:38:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 3950 transitions. [2025-03-08 16:38:52,353 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 3950 transitions. Word has length 148 [2025-03-08 16:38:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:38:52,353 INFO L471 AbstractCegarLoop]: Abstraction has 3180 states and 3950 transitions. [2025-03-08 16:38:52,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:38:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 3950 transitions. [2025-03-08 16:38:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:38:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:38:52,356 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:38:52,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:38:52,356 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:38:52,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:38:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1871159119, now seen corresponding path program 1 times [2025-03-08 16:38:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:38:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138833443] [2025-03-08 16:38:52,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:38:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:38:52,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:38:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:38:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:38:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:39:37,409 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 16:39:43,954 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)