./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:31:57,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:31:57,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:31:57,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:31:57,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:31:57,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:31:57,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:31:57,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:31:57,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:31:57,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:31:57,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:31:57,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:31:57,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:31:57,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:31:57,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:31:57,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:31:57,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:31:57,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:31:57,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:31:57,660 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2025-03-03 13:31:57,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:31:57,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:31:57,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:31:57,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:31:57,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:31:57,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2025-03-03 13:31:58,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1d02a6b/25106b05944e406bbb4b58a0bd00e4b9/FLAG01af15211 [2025-03-03 13:31:59,180 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:31:59,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2025-03-03 13:31:59,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1d02a6b/25106b05944e406bbb4b58a0bd00e4b9/FLAG01af15211 [2025-03-03 13:31:59,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1d02a6b/25106b05944e406bbb4b58a0bd00e4b9 [2025-03-03 13:31:59,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:31:59,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:31:59,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:31:59,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:31:59,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:31:59,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59, skipping insertion in model container [2025-03-03 13:31:59,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:31:59,341 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2025-03-03 13:31:59,344 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2025-03-03 13:31:59,345 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2025-03-03 13:31:59,345 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2025-03-03 13:31:59,347 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2025-03-03 13:31:59,347 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2025-03-03 13:31:59,348 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2025-03-03 13:31:59,353 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2025-03-03 13:31:59,355 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2025-03-03 13:31:59,357 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2025-03-03 13:31:59,358 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2025-03-03 13:31:59,360 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2025-03-03 13:31:59,362 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2025-03-03 13:31:59,364 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2025-03-03 13:31:59,364 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2025-03-03 13:31:59,365 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2025-03-03 13:31:59,367 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2025-03-03 13:31:59,367 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2025-03-03 13:31:59,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:31:59,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:31:59,383 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2025-03-03 13:31:59,383 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2025-03-03 13:31:59,384 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2025-03-03 13:31:59,385 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2025-03-03 13:31:59,386 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2025-03-03 13:31:59,386 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2025-03-03 13:31:59,387 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2025-03-03 13:31:59,388 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2025-03-03 13:31:59,389 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2025-03-03 13:31:59,390 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2025-03-03 13:31:59,390 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2025-03-03 13:31:59,391 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2025-03-03 13:31:59,392 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2025-03-03 13:31:59,393 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2025-03-03 13:31:59,393 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2025-03-03 13:31:59,394 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2025-03-03 13:31:59,395 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2025-03-03 13:31:59,400 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2025-03-03 13:31:59,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:31:59,409 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:31:59,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59 WrapperNode [2025-03-03 13:31:59,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:31:59,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:31:59,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:31:59,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:31:59,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,443 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 282 [2025-03-03 13:31:59,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:31:59,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:31:59,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:31:59,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:31:59,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:31:59,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:31:59,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:31:59,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:31:59,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:31:59,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (1/1) ... [2025-03-03 13:31:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:31:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:31:59,514 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-03 13:31:59,517 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-03 13:31:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:31:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:31:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:31:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:31:59,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:31:59,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:31:59,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~main____CPAchecker_TMP_3~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-03-03 13:31:59,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1; [2025-03-03 13:31:59,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-03 13:31:59,846 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-03 13:31:59,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:31:59,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:31:59,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:31:59,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:31:59 BoogieIcfgContainer [2025-03-03 13:31:59,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:31:59,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:31:59,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:31:59,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:31:59,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:31:59" (1/3) ... [2025-03-03 13:31:59,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611493e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:31:59, skipping insertion in model container [2025-03-03 13:31:59,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:31:59" (2/3) ... [2025-03-03 13:31:59,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611493e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:31:59, skipping insertion in model container [2025-03-03 13:31:59,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:31:59" (3/3) ... [2025-03-03 13:31:59,863 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2025-03-03 13:31:59,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:31:59,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-escape-absolute.i.v+cfa-reducer.c that has 1 procedures, 82 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-03 13:31:59,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:31:59,919 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;@31f33124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:31:59,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-03 13:31:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:31:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:31:59,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:31:59,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:31:59,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:31:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:31:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -48597025, now seen corresponding path program 1 times [2025-03-03 13:31:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:31:59,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915150851] [2025-03-03 13:31:59,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:31:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:31:59,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:31:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:31:59,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:31:59,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915150851] [2025-03-03 13:32:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915150851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:32:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752740652] [2025-03-03 13:32:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:32:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:32:00,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:32:00,141 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,159 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2025-03-03 13:32:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:32:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:32:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,165 INFO L225 Difference]: With dead ends: 85 [2025-03-03 13:32:00,166 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 13:32:00,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:32:00,171 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 13:32:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-03 13:32:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-03 13:32:00,198 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2025-03-03 13:32:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,199 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-03 13:32:00,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-03 13:32:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:32:00,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:00,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:32:00,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1506503938, now seen corresponding path program 1 times [2025-03-03 13:32:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-03-03 13:32:00,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:32:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:32:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-03-03 13:32:00,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370768938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001692483] [2025-03-03 13:32:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:00,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:00,318 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,394 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-03 13:32:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:32:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 13:32:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,396 INFO L225 Difference]: With dead ends: 76 [2025-03-03 13:32:00,396 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 13:32:00,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:00,397 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 13:32:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 13:32:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-03-03 13:32:00,404 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2025-03-03 13:32:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,405 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-03-03 13:32:00,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-03-03 13:32:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:32:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:32:00,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -346190906, now seen corresponding path program 1 times [2025-03-03 13:32:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798107150] [2025-03-03 13:32:00,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:32:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:32:00,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798107150] [2025-03-03 13:32:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798107150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068786820] [2025-03-03 13:32:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:00,486 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,541 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2025-03-03 13:32:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:00,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:32:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,542 INFO L225 Difference]: With dead ends: 97 [2025-03-03 13:32:00,542 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 13:32:00,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 13:32:00,543 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 13:32:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2025-03-03 13:32:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-03-03 13:32:00,550 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2025-03-03 13:32:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-03-03 13:32:00,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-03-03 13:32:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:32:00,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:32:00,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2141980268, now seen corresponding path program 1 times [2025-03-03 13:32:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026664605] [2025-03-03 13:32:00,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:32:00,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:32:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026664605] [2025-03-03 13:32:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026664605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605219444] [2025-03-03 13:32:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:00,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:00,616 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,677 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-03 13:32:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:00,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 13:32:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,678 INFO L225 Difference]: With dead ends: 72 [2025-03-03 13:32:00,678 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:32:00,678 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-03 13:32:00,678 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 54 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 152 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:32:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 13:32:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-03-03 13:32:00,683 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2025-03-03 13:32:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,683 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-03-03 13:32:00,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-03-03 13:32:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:32:00,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:00,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:32:00,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1400183517, now seen corresponding path program 1 times [2025-03-03 13:32:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341419037] [2025-03-03 13:32:00,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:32:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:32:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341419037] [2025-03-03 13:32:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341419037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797362476] [2025-03-03 13:32:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:00,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:00,762 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,824 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-03-03 13:32:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:32:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,825 INFO L225 Difference]: With dead ends: 93 [2025-03-03 13:32:00,825 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 13:32:00,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:00,826 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 210 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 13:32:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2025-03-03 13:32:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-03 13:32:00,829 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2025-03-03 13:32:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,829 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-03 13:32:00,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-03 13:32:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:32:00,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:00,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:32:00,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1400138924, now seen corresponding path program 1 times [2025-03-03 13:32:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044599922] [2025-03-03 13:32:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:32:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:32:00,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044599922] [2025-03-03 13:32:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044599922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645114975] [2025-03-03 13:32:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:00,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:00,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:00,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:00,882 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:00,951 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-03-03 13:32:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:00,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:32:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:00,952 INFO L225 Difference]: With dead ends: 91 [2025-03-03 13:32:00,952 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 13:32:00,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:00,953 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 21 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:00,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 210 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 13:32:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2025-03-03 13:32:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-03-03 13:32:00,956 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2025-03-03 13:32:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:00,956 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-03-03 13:32:00,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-03-03 13:32:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:32:00,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:00,957 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:32:00,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:32:00,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash -456016660, now seen corresponding path program 1 times [2025-03-03 13:32:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:00,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996726633] [2025-03-03 13:32:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:00,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:32:00,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:32:00,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:00,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996726633] [2025-03-03 13:32:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996726633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:01,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005595857] [2025-03-03 13:32:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:01,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:01,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:01,014 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:01,073 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-03-03 13:32:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:32:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:01,074 INFO L225 Difference]: With dead ends: 75 [2025-03-03 13:32:01,074 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 13:32:01,074 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-03 13:32:01,075 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:01,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 13:32:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 13:32:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-03 13:32:01,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2025-03-03 13:32:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:01,077 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-03 13:32:01,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-03 13:32:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:32:01,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:01,078 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:32:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:32:01,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash -454631534, now seen corresponding path program 1 times [2025-03-03 13:32:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106502313] [2025-03-03 13:32:01,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:01,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:32:01,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:32:01,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106502313] [2025-03-03 13:32:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106502313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:01,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539157301] [2025-03-03 13:32:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:01,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:01,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:01,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:01,126 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:01,169 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2025-03-03 13:32:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:32:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:01,170 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:32:01,170 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 13:32:01,170 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-03 13:32:01,170 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:01,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 153 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 13:32:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 13:32:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-03-03 13:32:01,176 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2025-03-03 13:32:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:01,176 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-03-03 13:32:01,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-03-03 13:32:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:32:01,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:01,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:01,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:32:01,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1185883353, now seen corresponding path program 1 times [2025-03-03 13:32:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-03 13:32:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:32:01,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:32:01,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-03 13:32:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976882609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:01,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:32:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-03-03 13:32:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:01,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:32:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:01,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:32:01,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:32:01,197 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:01,221 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2025-03-03 13:32:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:32:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 13:32:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:01,221 INFO L225 Difference]: With dead ends: 111 [2025-03-03 13:32:01,222 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 13:32:01,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:32:01,222 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 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-03 13:32:01,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 13:32:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 13:32:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-03-03 13:32:01,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2025-03-03 13:32:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:01,224 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-03-03 13:32:01,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-03-03 13:32:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:32:01,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:01,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 13:32:01,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -211259393, now seen corresponding path program 1 times [2025-03-03 13:32:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457231398] [2025-03-03 13:32:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:01,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:32:01,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:32:01,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457231398] [2025-03-03 13:32:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457231398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908370131] [2025-03-03 13:32:01,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:01,328 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-03 13:32:01,334 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-03 13:32:01,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:32:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:32:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:32:01,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:01,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908370131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:01,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 13:32:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291153726] [2025-03-03 13:32:01,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:01,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:01,489 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:01,536 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-03 13:32:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 13:32:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:01,537 INFO L225 Difference]: With dead ends: 72 [2025-03-03 13:32:01,537 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:32:01,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:01,537 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 85 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:01,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:32:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-03 13:32:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-03-03 13:32:01,539 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2025-03-03 13:32:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-03-03 13:32:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-03-03 13:32:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:32:01,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:01,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:01,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:32:01,744 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,SelfDestructingSolverStorable9 [2025-03-03 13:32:01,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:01,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 320010386, now seen corresponding path program 1 times [2025-03-03 13:32:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:01,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270782716] [2025-03-03 13:32:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:01,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:32:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:32:01,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270782716] [2025-03-03 13:32:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270782716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506386721] [2025-03-03 13:32:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:01,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:01,830 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:01,882 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-03-03 13:32:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 13:32:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:01,883 INFO L225 Difference]: With dead ends: 69 [2025-03-03 13:32:01,883 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 13:32:01,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:01,883 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:01,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 13:32:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-03 13:32:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-03 13:32:01,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2025-03-03 13:32:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-03 13:32:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-03 13:32:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:32:01,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:01,886 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 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-03 13:32:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 13:32:01,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2040910559, now seen corresponding path program 1 times [2025-03-03 13:32:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:01,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-03 13:32:01,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:01,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:32:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:32:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-03 13:32:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520830732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219003993] [2025-03-03 13:32:01,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:01,965 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-03 13:32:01,966 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-03 13:32:01,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:32:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:32:02,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:32:02,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:02,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:32:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219003993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:02,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 13:32:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936969354] [2025-03-03 13:32:02,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:02,078 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,124 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-03 13:32:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:32:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,125 INFO L225 Difference]: With dead ends: 67 [2025-03-03 13:32:02,125 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 13:32:02,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:02,126 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 13:32:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2025-03-03 13:32:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-03-03 13:32:02,127 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2025-03-03 13:32:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-03-03 13:32:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-03-03 13:32:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:32:02,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:32:02,332 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,SelfDestructingSolverStorable11 [2025-03-03 13:32:02,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1330388976, now seen corresponding path program 1 times [2025-03-03 13:32:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384393050] [2025-03-03 13:32:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:32:02,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:32:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384393050] [2025-03-03 13:32:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384393050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588730744] [2025-03-03 13:32:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:02,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:02,405 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,445 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-03-03 13:32:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:32:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,446 INFO L225 Difference]: With dead ends: 60 [2025-03-03 13:32:02,446 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:32:02,446 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-03 13:32:02,446 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 116 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:32:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 13:32:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2025-03-03 13:32:02,453 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2025-03-03 13:32:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,453 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2025-03-03 13:32:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2025-03-03 13:32:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:32:02,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 13:32:02,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash -336943614, now seen corresponding path program 1 times [2025-03-03 13:32:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165159651] [2025-03-03 13:32:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:32:02,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:32:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165159651] [2025-03-03 13:32:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165159651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971289999] [2025-03-03 13:32:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:02,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:02,535 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,570 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-03-03 13:32:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:02,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 13:32:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,571 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:32:02,571 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 13:32:02,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:02,572 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 59 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 85 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 13:32:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-03-03 13:32:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2025-03-03 13:32:02,574 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2025-03-03 13:32:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,575 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-03-03 13:32:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2025-03-03 13:32:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:32:02,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 13:32:02,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1855316512, now seen corresponding path program 1 times [2025-03-03 13:32:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-03-03 13:32:02,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 13:32:02,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:32:02,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-03-03 13:32:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87534598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:32:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210760876] [2025-03-03 13:32:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:02,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:02,647 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,705 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-03 13:32:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:32:02,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 13:32:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,706 INFO L225 Difference]: With dead ends: 67 [2025-03-03 13:32:02,706 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 13:32:02,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:02,707 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 118 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 13:32:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2025-03-03 13:32:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-03-03 13:32:02,708 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2025-03-03 13:32:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,708 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-03-03 13:32:02,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-03-03 13:32:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:32:02,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 13:32:02,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 202535792, now seen corresponding path program 1 times [2025-03-03 13:32:02,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104428914] [2025-03-03 13:32:02,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 13:32:02,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:32:02,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104428914] [2025-03-03 13:32:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104428914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074474107] [2025-03-03 13:32:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:02,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:02,767 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,822 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-03-03 13:32:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:02,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 13:32:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,823 INFO L225 Difference]: With dead ends: 87 [2025-03-03 13:32:02,823 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 13:32:02,823 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-03 13:32:02,823 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 131 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 13:32:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2025-03-03 13:32:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-03-03 13:32:02,824 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2025-03-03 13:32:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,824 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-03-03 13:32:02,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-03-03 13:32:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:32:02,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 13:32:02,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1983642605, now seen corresponding path program 1 times [2025-03-03 13:32:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-03 13:32:02,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:32:02,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:32:02,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-03 13:32:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802203745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255466510] [2025-03-03 13:32:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:02,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:02,883 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,918 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2025-03-03 13:32:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 13:32:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,919 INFO L225 Difference]: With dead ends: 57 [2025-03-03 13:32:02,919 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 13:32:02,919 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-03 13:32:02,919 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 13:32:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 13:32:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2025-03-03 13:32:02,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2025-03-03 13:32:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,921 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2025-03-03 13:32:02,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2025-03-03 13:32:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:32:02,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 13:32:02,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -684932875, now seen corresponding path program 1 times [2025-03-03 13:32:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-03-03 13:32:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:32:02,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:32:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-03-03 13:32:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434202644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842631598] [2025-03-03 13:32:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:02,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:02,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:02,977 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:02,986 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2025-03-03 13:32:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 13:32:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:02,987 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:32:02,987 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:32:02,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:02,987 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:02,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 140 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:32:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2025-03-03 13:32:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-03-03 13:32:02,989 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2025-03-03 13:32:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:02,989 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-03-03 13:32:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-03-03 13:32:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:32:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:02,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 13:32:02,989 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 241917124, now seen corresponding path program 1 times [2025-03-03 13:32:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229517586] [2025-03-03 13:32:02,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:32:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:32:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229517586] [2025-03-03 13:32:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229517586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:03,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:03,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:03,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928421416] [2025-03-03 13:32:03,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:03,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:03,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:03,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:03,046 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:03,062 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-03 13:32:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 13:32:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:03,063 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:32:03,063 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 13:32:03,063 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-03 13:32:03,063 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:03,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 185 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 13:32:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-03 13:32:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-03-03 13:32:03,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2025-03-03 13:32:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-03-03 13:32:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-03-03 13:32:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:32:03,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:03,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:03,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 13:32:03,065 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1090504192, now seen corresponding path program 1 times [2025-03-03 13:32:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:03,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-03-03 13:32:03,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:03,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:32:03,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:32:03,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:03,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-03-03 13:32:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510784571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488637160] [2025-03-03 13:32:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:03,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:03,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:03,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:03,118 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:03,174 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2025-03-03 13:32:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:32:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:03,174 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:32:03,174 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 13:32:03,174 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-03 13:32:03,175 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:03,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 107 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 13:32:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2025-03-03 13:32:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-03 13:32:03,176 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2025-03-03 13:32:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:03,176 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-03 13:32:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-03 13:32:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:32:03,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:03,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:03,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 13:32:03,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:03,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 554107759, now seen corresponding path program 1 times [2025-03-03 13:32:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:03,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657891642] [2025-03-03 13:32:03,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:32:03,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:32:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657891642] [2025-03-03 13:32:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657891642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:03,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693593078] [2025-03-03 13:32:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:03,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:03,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:03,253 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:03,289 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-03 13:32:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:32:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:03,289 INFO L225 Difference]: With dead ends: 56 [2025-03-03 13:32:03,290 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 13:32:03,290 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-03 13:32:03,290 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:03,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 13:32:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 13:32:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-03-03 13:32:03,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2025-03-03 13:32:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:03,291 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-03-03 13:32:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-03-03 13:32:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:32:03,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:03,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 13:32:03,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 13:32:03,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:03,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash 603669019, now seen corresponding path program 1 times [2025-03-03 13:32:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966260828] [2025-03-03 13:32:03,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:32:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:32:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966260828] [2025-03-03 13:32:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966260828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512271370] [2025-03-03 13:32:03,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:03,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:03,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:03,393 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-03 13:32:03,394 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-03 13:32:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:32:03,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:32:03,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:32:03,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512271370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:03,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 13:32:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759737967] [2025-03-03 13:32:03,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:03,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:32:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:03,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:32:03,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:32:03,616 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:03,667 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-03-03 13:32:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:32:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:03,668 INFO L225 Difference]: With dead ends: 54 [2025-03-03 13:32:03,668 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 13:32:03,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:32:03,669 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:03,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 13:32:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-03 13:32:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-03-03 13:32:03,670 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2025-03-03 13:32:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:03,670 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-03-03 13:32:03,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-03-03 13:32:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:32:03,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:03,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 13:32:03,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:32:03,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:03,875 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2025-03-03 13:32:03,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 37019189, now seen corresponding path program 1 times [2025-03-03 13:32:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:03,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-03-03 13:32:03,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:03,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:32:03,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:32:03,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:32:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-03-03 13:32:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832913749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:32:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022862739] [2025-03-03 13:32:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:03,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:32:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:03,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:32:03,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:32:03,939 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:03,987 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-03-03 13:32:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:32:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 13:32:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:03,988 INFO L225 Difference]: With dead ends: 63 [2025-03-03 13:32:03,988 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:32:03,988 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-03 13:32:03,988 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:03,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 86 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:32:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:32:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:32:03,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-03-03 13:32:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:03,989 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:32:03,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:32:03,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2025-03-03 13:32:03,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2025-03-03 13:32:03,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2025-03-03 13:32:03,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 13:32:03,995 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:03,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:32:04,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:32:04,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:32:04 BoogieIcfgContainer [2025-03-03 13:32:04,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:32:04,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:32:04,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:32:04,004 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:32:04,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:31:59" (3/4) ... [2025-03-03 13:32:04,006 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:32:04,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-03 13:32:04,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:32:04,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:32:04,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:32:04,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:32:04,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:32:04,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:32:04,087 INFO L158 Benchmark]: Toolchain (without parser) took 4865.89ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.0MB in the beginning and 136.6MB in the end (delta: -26.7MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2025-03-03 13:32:04,087 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.72ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 96.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: Boogie Preprocessor took 37.95ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: IcfgBuilder took 370.38ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 72.4MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: TraceAbstraction took 4146.21ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 71.3MB in the beginning and 145.0MB in the end (delta: -73.8MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-03-03 13:32:04,088 INFO L158 Benchmark]: Witness Printer took 82.54ms. Allocated memory is still 285.2MB. Free memory was 145.0MB in the beginning and 136.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:32:04,090 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.72ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 96.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.95ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.38ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 72.4MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4146.21ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 71.3MB in the beginning and 145.0MB in the end (delta: -73.8MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 82.54ms. Allocated memory is still 285.2MB. Free memory was 145.0MB in the beginning and 136.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 97]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 189]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 214]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 226]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 243]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 255]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 272]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 284]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 296]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 308]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 374]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 386]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736 mSDsluCounter, 3180 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2075 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1382 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1105 mSDtfsCounter, 1382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 209 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 129 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 2275 SizeOfPredicates, 6 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 13:32:04,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE