./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd8e58e4dd7f21a353342bc0a492b99ed688619f4c3decc3151bb6acbb6daeee1'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8e58e4dd7f21a353342bc0a492b99ed688619f4c3decc3151bb6acbb6daeee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:34:09,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:34:09,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:34:09,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:34:09,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:34:09,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:34:09,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:34:09,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:34:09,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:34:09,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:34:09,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:34:09,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:34:09,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:34:09,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:34:09,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:34:09,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:34:09,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:34:09,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:34:09,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:34:09,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:34:09,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:34:09,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:34:09,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:34:09,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:34:09,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:34:09,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:34:09,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8e58e4dd7f21a353342bc0a492b99ed688619f4c3decc3151bb6acbb6daeee1 [2024-11-07 00:34:09,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:34:09,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:34:09,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:34:09,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:34:09,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:34:09,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2024-11-07 00:34:11,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:34:11,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:34:11,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2024-11-07 00:34:11,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b07ce2917/932155ad28e842c2a938bfc691ff1b0d/FLAGb284b44de [2024-11-07 00:34:12,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b07ce2917/932155ad28e842c2a938bfc691ff1b0d [2024-11-07 00:34:12,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:34:12,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:34:12,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:34:12,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:34:12,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:34:12,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:12" (1/1) ... [2024-11-07 00:34:12,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fd24fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:12, skipping insertion in model container [2024-11-07 00:34:12,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:12" (1/1) ... [2024-11-07 00:34:12,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:34:12,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2024-11-07 00:34:13,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2024-11-07 00:34:13,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2024-11-07 00:34:13,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2024-11-07 00:34:13,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2024-11-07 00:34:13,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2024-11-07 00:34:13,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2024-11-07 00:34:13,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2024-11-07 00:34:13,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2024-11-07 00:34:13,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2024-11-07 00:34:13,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2024-11-07 00:34:13,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2024-11-07 00:34:13,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2024-11-07 00:34:13,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2024-11-07 00:34:13,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2024-11-07 00:34:13,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2024-11-07 00:34:13,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2024-11-07 00:34:13,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2024-11-07 00:34:13,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2024-11-07 00:34:13,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2024-11-07 00:34:13,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2024-11-07 00:34:13,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2024-11-07 00:34:13,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:34:13,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:34:13,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2024-11-07 00:34:13,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2024-11-07 00:34:13,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2024-11-07 00:34:13,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2024-11-07 00:34:13,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2024-11-07 00:34:13,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2024-11-07 00:34:13,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2024-11-07 00:34:13,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2024-11-07 00:34:13,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2024-11-07 00:34:13,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2024-11-07 00:34:13,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2024-11-07 00:34:14,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2024-11-07 00:34:14,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2024-11-07 00:34:14,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2024-11-07 00:34:14,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2024-11-07 00:34:14,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2024-11-07 00:34:14,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2024-11-07 00:34:14,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2024-11-07 00:34:14,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2024-11-07 00:34:14,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2024-11-07 00:34:14,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2024-11-07 00:34:14,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2024-11-07 00:34:14,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:34:14,171 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:34:14,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14 WrapperNode [2024-11-07 00:34:14,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:34:14,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:34:14,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:34:14,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:34:14,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,483 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13233 [2024-11-07 00:34:14,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:34:14,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:34:14,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:34:14,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:34:14,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,611 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]. [2024-11-07 00:34:14,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:34:14,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:34:14,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:34:14,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:34:14,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (1/1) ... [2024-11-07 00:34:14,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:34:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:34:14,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:34:14,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:34:14,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:34:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:34:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:34:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:34:15,389 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:34:15,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:34:21,311 INFO L? ?]: Removed 2736 outVars from TransFormulas that were not future-live. [2024-11-07 00:34:21,312 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:34:21,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:34:21,376 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:34:21,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:21 BoogieIcfgContainer [2024-11-07 00:34:21,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:34:21,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:34:21,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:34:21,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:34:21,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:12" (1/3) ... [2024-11-07 00:34:21,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:21, skipping insertion in model container [2024-11-07 00:34:21,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:14" (2/3) ... [2024-11-07 00:34:21,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:21, skipping insertion in model container [2024-11-07 00:34:21,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:21" (3/3) ... [2024-11-07 00:34:21,387 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2024-11-07 00:34:21,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:34:21,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 00:34:21,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:34:21,545 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;@20f5abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:34:21,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 00:34:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 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) [2024-11-07 00:34:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:34:21,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:21,589 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:21,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:21,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -876960142, now seen corresponding path program 1 times [2024-11-07 00:34:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:21,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444446542] [2024-11-07 00:34:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444446542] [2024-11-07 00:34:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444446542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:22,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380171443] [2024-11-07 00:34:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:22,479 INFO L87 Difference]: Start difference. First operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 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 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:24,451 INFO L93 Difference]: Finished difference Result 3317 states and 5684 transitions. [2024-11-07 00:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:24,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2024-11-07 00:34:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:24,482 INFO L225 Difference]: With dead ends: 3317 [2024-11-07 00:34:24,482 INFO L226 Difference]: Without dead ends: 2045 [2024-11-07 00:34:24,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:24,493 INFO L432 NwaCegarLoop]: 1898 mSDtfsCounter, 10325 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10325 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:24,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10325 Valid, 1912 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:34:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-11-07 00:34:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2024-11-07 00:34:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2023 states have (on average 1.3015323776569452) internal successors, (2633), 2044 states have internal predecessors, (2633), 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) [2024-11-07 00:34:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2633 transitions. [2024-11-07 00:34:24,631 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2633 transitions. Word has length 87 [2024-11-07 00:34:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 2633 transitions. [2024-11-07 00:34:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2633 transitions. [2024-11-07 00:34:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:34:24,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:24,639 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:24,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:34:24,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:24,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1410328050, now seen corresponding path program 1 times [2024-11-07 00:34:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349118514] [2024-11-07 00:34:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349118514] [2024-11-07 00:34:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349118514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:24,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472839787] [2024-11-07 00:34:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:24,945 INFO L87 Difference]: Start difference. First operand 2045 states and 2633 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:25,805 INFO L93 Difference]: Finished difference Result 2235 states and 2854 transitions. [2024-11-07 00:34:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2024-11-07 00:34:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:25,811 INFO L225 Difference]: With dead ends: 2235 [2024-11-07 00:34:25,811 INFO L226 Difference]: Without dead ends: 1245 [2024-11-07 00:34:25,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:25,813 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 4688 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:25,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 830 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:34:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-07 00:34:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1245. [2024-11-07 00:34:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1223 states have (on average 1.3082583810302535) internal successors, (1600), 1244 states have internal predecessors, (1600), 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) [2024-11-07 00:34:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1600 transitions. [2024-11-07 00:34:25,839 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1600 transitions. Word has length 87 [2024-11-07 00:34:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:25,843 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1600 transitions. [2024-11-07 00:34:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1600 transitions. [2024-11-07 00:34:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:34:25,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:25,848 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:34:25,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:25,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1125625269, now seen corresponding path program 1 times [2024-11-07 00:34:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60276032] [2024-11-07 00:34:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60276032] [2024-11-07 00:34:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60276032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054957198] [2024-11-07 00:34:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:26,106 INFO L87 Difference]: Start difference. First operand 1245 states and 1600 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:26,667 INFO L93 Difference]: Finished difference Result 1533 states and 1966 transitions. [2024-11-07 00:34:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2024-11-07 00:34:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:26,672 INFO L225 Difference]: With dead ends: 1533 [2024-11-07 00:34:26,672 INFO L226 Difference]: Without dead ends: 905 [2024-11-07 00:34:26,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:26,674 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 3408 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3408 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:26,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3408 Valid, 658 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:34:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-07 00:34:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2024-11-07 00:34:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3216308040770102) internal successors, (1167), 904 states have internal predecessors, (1167), 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) [2024-11-07 00:34:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1167 transitions. [2024-11-07 00:34:26,694 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1167 transitions. Word has length 87 [2024-11-07 00:34:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:26,694 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1167 transitions. [2024-11-07 00:34:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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) [2024-11-07 00:34:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1167 transitions. [2024-11-07 00:34:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 00:34:26,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:26,698 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:34:26,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash -229604869, now seen corresponding path program 1 times [2024-11-07 00:34:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145489775] [2024-11-07 00:34:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145489775] [2024-11-07 00:34:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145489775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861916354] [2024-11-07 00:34:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:26,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:26,922 INFO L87 Difference]: Start difference. First operand 905 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-07 00:34:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:27,416 INFO L93 Difference]: Finished difference Result 1277 states and 1652 transitions. [2024-11-07 00:34:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2024-11-07 00:34:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:27,420 INFO L225 Difference]: With dead ends: 1277 [2024-11-07 00:34:27,421 INFO L226 Difference]: Without dead ends: 798 [2024-11-07 00:34:27,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:27,424 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 3042 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:27,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 597 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:34:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-07 00:34:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2024-11-07 00:34:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 776 states have (on average 1.336340206185567) internal successors, (1037), 797 states have internal predecessors, (1037), 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) [2024-11-07 00:34:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1037 transitions. [2024-11-07 00:34:27,443 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1037 transitions. Word has length 89 [2024-11-07 00:34:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:27,444 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1037 transitions. [2024-11-07 00:34:27,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-07 00:34:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1037 transitions. [2024-11-07 00:34:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:34:27,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:27,447 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:34:27,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1455647616, now seen corresponding path program 1 times [2024-11-07 00:34:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052906694] [2024-11-07 00:34:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:27,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052906694] [2024-11-07 00:34:27,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052906694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:27,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:27,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:27,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164998424] [2024-11-07 00:34:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:27,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:27,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:27,674 INFO L87 Difference]: Start difference. First operand 798 states and 1037 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-11-07 00:34:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:28,032 INFO L93 Difference]: Finished difference Result 1134 states and 1473 transitions. [2024-11-07 00:34:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2024-11-07 00:34:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:28,035 INFO L225 Difference]: With dead ends: 1134 [2024-11-07 00:34:28,035 INFO L226 Difference]: Without dead ends: 710 [2024-11-07 00:34:28,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:28,037 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 2695 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:28,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 557 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:34:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-07 00:34:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-07 00:34:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 688 states have (on average 1.3444767441860466) internal successors, (925), 709 states have internal predecessors, (925), 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) [2024-11-07 00:34:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 925 transitions. [2024-11-07 00:34:28,051 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 925 transitions. Word has length 91 [2024-11-07 00:34:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:28,051 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 925 transitions. [2024-11-07 00:34:28,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-11-07 00:34:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 925 transitions. [2024-11-07 00:34:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:34:28,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:28,054 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:34:28,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 591523847, now seen corresponding path program 1 times [2024-11-07 00:34:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837504204] [2024-11-07 00:34:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837504204] [2024-11-07 00:34:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837504204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112359715] [2024-11-07 00:34:28,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:28,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:28,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:28,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:28,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:28,249 INFO L87 Difference]: Start difference. First operand 710 states and 925 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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) [2024-11-07 00:34:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:28,714 INFO L93 Difference]: Finished difference Result 1088 states and 1423 transitions. [2024-11-07 00:34:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:28,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2024-11-07 00:34:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:28,716 INFO L225 Difference]: With dead ends: 1088 [2024-11-07 00:34:28,717 INFO L226 Difference]: Without dead ends: 702 [2024-11-07 00:34:28,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:34:28,718 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 2604 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:28,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 482 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:34:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-07 00:34:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2024-11-07 00:34:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3455882352941178) internal successors, (915), 701 states have internal predecessors, (915), 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) [2024-11-07 00:34:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 915 transitions. [2024-11-07 00:34:28,730 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 915 transitions. Word has length 93 [2024-11-07 00:34:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:28,730 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 915 transitions. [2024-11-07 00:34:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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) [2024-11-07 00:34:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 915 transitions. [2024-11-07 00:34:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:34:28,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:28,733 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:34:28,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 328441748, now seen corresponding path program 1 times [2024-11-07 00:34:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783712683] [2024-11-07 00:34:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783712683] [2024-11-07 00:34:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783712683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:29,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:29,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:34:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281678277] [2024-11-07 00:34:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:34:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:34:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:34:29,267 INFO L87 Difference]: Start difference. First operand 702 states and 915 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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) [2024-11-07 00:34:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:30,320 INFO L93 Difference]: Finished difference Result 1330 states and 1688 transitions. [2024-11-07 00:34:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:34:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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 95 [2024-11-07 00:34:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:30,324 INFO L225 Difference]: With dead ends: 1330 [2024-11-07 00:34:30,324 INFO L226 Difference]: Without dead ends: 951 [2024-11-07 00:34:30,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:34:30,326 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 4276 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4276 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:30,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4276 Valid, 1610 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:34:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-07 00:34:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 702. [2024-11-07 00:34:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3441176470588236) internal successors, (914), 701 states have internal predecessors, (914), 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) [2024-11-07 00:34:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 914 transitions. [2024-11-07 00:34:30,342 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 914 transitions. Word has length 95 [2024-11-07 00:34:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:30,343 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 914 transitions. [2024-11-07 00:34:30,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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) [2024-11-07 00:34:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 914 transitions. [2024-11-07 00:34:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:34:30,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:30,345 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:30,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:34:30,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:30,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash 556118932, now seen corresponding path program 1 times [2024-11-07 00:34:30,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:30,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782479521] [2024-11-07 00:34:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782479521] [2024-11-07 00:34:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782479521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:30,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009167066] [2024-11-07 00:34:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:30,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:30,886 INFO L87 Difference]: Start difference. First operand 702 states and 914 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-11-07 00:34:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:32,469 INFO L93 Difference]: Finished difference Result 1293 states and 1703 transitions. [2024-11-07 00:34:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2024-11-07 00:34:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:32,476 INFO L225 Difference]: With dead ends: 1293 [2024-11-07 00:34:32,476 INFO L226 Difference]: Without dead ends: 1084 [2024-11-07 00:34:32,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:32,478 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 3792 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3792 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:32,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3792 Valid, 3900 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:34:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-07 00:34:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 702. [2024-11-07 00:34:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3426470588235293) internal successors, (913), 701 states have internal predecessors, (913), 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) [2024-11-07 00:34:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 913 transitions. [2024-11-07 00:34:32,496 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 913 transitions. Word has length 95 [2024-11-07 00:34:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:32,496 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 913 transitions. [2024-11-07 00:34:32,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-11-07 00:34:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 913 transitions. [2024-11-07 00:34:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:34:32,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:32,500 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:34:32,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1071889132, now seen corresponding path program 1 times [2024-11-07 00:34:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212332179] [2024-11-07 00:34:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212332179] [2024-11-07 00:34:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212332179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:32,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960391098] [2024-11-07 00:34:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:32,969 INFO L87 Difference]: Start difference. First operand 702 states and 913 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-11-07 00:34:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:34,211 INFO L93 Difference]: Finished difference Result 1212 states and 1598 transitions. [2024-11-07 00:34:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2024-11-07 00:34:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:34,215 INFO L225 Difference]: With dead ends: 1212 [2024-11-07 00:34:34,215 INFO L226 Difference]: Without dead ends: 1079 [2024-11-07 00:34:34,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:34,216 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 4632 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:34,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 2790 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:34:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-07 00:34:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 702. [2024-11-07 00:34:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3411764705882352) internal successors, (912), 701 states have internal predecessors, (912), 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) [2024-11-07 00:34:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 912 transitions. [2024-11-07 00:34:34,229 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 912 transitions. Word has length 95 [2024-11-07 00:34:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:34,230 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 912 transitions. [2024-11-07 00:34:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-11-07 00:34:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 912 transitions. [2024-11-07 00:34:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:34:34,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:34,232 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:34,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:34:34,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:34,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1164032538, now seen corresponding path program 1 times [2024-11-07 00:34:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326181852] [2024-11-07 00:34:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326181852] [2024-11-07 00:34:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326181852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794828616] [2024-11-07 00:34:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:34,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:34,557 INFO L87 Difference]: Start difference. First operand 702 states and 912 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 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) [2024-11-07 00:34:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:35,708 INFO L93 Difference]: Finished difference Result 1171 states and 1535 transitions. [2024-11-07 00:34:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2024-11-07 00:34:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:35,712 INFO L225 Difference]: With dead ends: 1171 [2024-11-07 00:34:35,712 INFO L226 Difference]: Without dead ends: 1072 [2024-11-07 00:34:35,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:35,713 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 3589 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3589 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:35,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3589 Valid, 2498 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:34:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-07 00:34:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2024-11-07 00:34:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.339705882352941) internal successors, (911), 701 states have internal predecessors, (911), 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) [2024-11-07 00:34:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 911 transitions. [2024-11-07 00:34:35,728 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 911 transitions. Word has length 96 [2024-11-07 00:34:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:35,728 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 911 transitions. [2024-11-07 00:34:35,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 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) [2024-11-07 00:34:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 911 transitions. [2024-11-07 00:34:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:35,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:35,730 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:34:35,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1887012889, now seen corresponding path program 1 times [2024-11-07 00:34:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:35,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730182933] [2024-11-07 00:34:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730182933] [2024-11-07 00:34:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730182933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:34:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859979637] [2024-11-07 00:34:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:36,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:34:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:34:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:34:36,262 INFO L87 Difference]: Start difference. First operand 702 states and 911 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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) [2024-11-07 00:34:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:37,539 INFO L93 Difference]: Finished difference Result 1247 states and 1630 transitions. [2024-11-07 00:34:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:34:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:37,542 INFO L225 Difference]: With dead ends: 1247 [2024-11-07 00:34:37,542 INFO L226 Difference]: Without dead ends: 1085 [2024-11-07 00:34:37,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:34:37,544 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 3473 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:37,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3473 Valid, 3705 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:34:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-07 00:34:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 706. [2024-11-07 00:34:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.337719298245614) internal successors, (915), 705 states have internal predecessors, (915), 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) [2024-11-07 00:34:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 915 transitions. [2024-11-07 00:34:37,556 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 915 transitions. Word has length 97 [2024-11-07 00:34:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:37,556 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 915 transitions. [2024-11-07 00:34:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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) [2024-11-07 00:34:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 915 transitions. [2024-11-07 00:34:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:37,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:37,558 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:37,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:34:37,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:37,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1865673127, now seen corresponding path program 1 times [2024-11-07 00:34:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460395016] [2024-11-07 00:34:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460395016] [2024-11-07 00:34:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460395016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503955150] [2024-11-07 00:34:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:37,969 INFO L87 Difference]: Start difference. First operand 706 states and 915 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:39,156 INFO L93 Difference]: Finished difference Result 1323 states and 1726 transitions. [2024-11-07 00:34:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:39,159 INFO L225 Difference]: With dead ends: 1323 [2024-11-07 00:34:39,159 INFO L226 Difference]: Without dead ends: 1084 [2024-11-07 00:34:39,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:39,160 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 3955 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3955 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3955 Valid, 3286 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:34:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-07 00:34:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 702. [2024-11-07 00:34:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.338235294117647) internal successors, (910), 701 states have internal predecessors, (910), 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) [2024-11-07 00:34:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 910 transitions. [2024-11-07 00:34:39,171 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 910 transitions. Word has length 97 [2024-11-07 00:34:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:39,171 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 910 transitions. [2024-11-07 00:34:39,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 910 transitions. [2024-11-07 00:34:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:39,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:39,173 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:39,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:34:39,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2083812519, now seen corresponding path program 1 times [2024-11-07 00:34:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810032244] [2024-11-07 00:34:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810032244] [2024-11-07 00:34:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810032244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630439708] [2024-11-07 00:34:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:39,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:39,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:39,493 INFO L87 Difference]: Start difference. First operand 702 states and 910 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:40,579 INFO L93 Difference]: Finished difference Result 1030 states and 1311 transitions. [2024-11-07 00:34:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:40,582 INFO L225 Difference]: With dead ends: 1030 [2024-11-07 00:34:40,582 INFO L226 Difference]: Without dead ends: 1024 [2024-11-07 00:34:40,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:40,583 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 4993 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4993 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:40,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4993 Valid, 2114 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:34:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-11-07 00:34:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 702. [2024-11-07 00:34:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3367647058823529) internal successors, (909), 701 states have internal predecessors, (909), 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) [2024-11-07 00:34:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 909 transitions. [2024-11-07 00:34:40,594 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 909 transitions. Word has length 97 [2024-11-07 00:34:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:40,594 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 909 transitions. [2024-11-07 00:34:40,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 909 transitions. [2024-11-07 00:34:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:40,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:40,596 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:40,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:34:40,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:40,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1112735129, now seen corresponding path program 1 times [2024-11-07 00:34:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667153156] [2024-11-07 00:34:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:40,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667153156] [2024-11-07 00:34:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667153156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:40,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294071076] [2024-11-07 00:34:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:40,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:40,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:40,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:40,921 INFO L87 Difference]: Start difference. First operand 702 states and 909 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:42,186 INFO L93 Difference]: Finished difference Result 1226 states and 1605 transitions. [2024-11-07 00:34:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:42,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:42,189 INFO L225 Difference]: With dead ends: 1226 [2024-11-07 00:34:42,189 INFO L226 Difference]: Without dead ends: 1079 [2024-11-07 00:34:42,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:42,190 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 2872 mSDsluCounter, 2843 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:42,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2872 Valid, 3617 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:34:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-07 00:34:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 702. [2024-11-07 00:34:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3352941176470587) internal successors, (908), 701 states have internal predecessors, (908), 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) [2024-11-07 00:34:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 908 transitions. [2024-11-07 00:34:42,201 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 908 transitions. Word has length 97 [2024-11-07 00:34:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:42,201 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 908 transitions. [2024-11-07 00:34:42,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 908 transitions. [2024-11-07 00:34:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:42,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:42,203 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:42,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:34:42,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:42,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 725787161, now seen corresponding path program 1 times [2024-11-07 00:34:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806972848] [2024-11-07 00:34:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806972848] [2024-11-07 00:34:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806972848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:42,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207652629] [2024-11-07 00:34:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:42,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:42,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:42,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:42,545 INFO L87 Difference]: Start difference. First operand 702 states and 908 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:43,571 INFO L93 Difference]: Finished difference Result 1176 states and 1535 transitions. [2024-11-07 00:34:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:43,574 INFO L225 Difference]: With dead ends: 1176 [2024-11-07 00:34:43,574 INFO L226 Difference]: Without dead ends: 1072 [2024-11-07 00:34:43,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:43,577 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 3093 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3093 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:43,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3093 Valid, 2986 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:34:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-07 00:34:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 702. [2024-11-07 00:34:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 680 states have (on average 1.3338235294117646) internal successors, (907), 701 states have internal predecessors, (907), 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) [2024-11-07 00:34:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 907 transitions. [2024-11-07 00:34:43,590 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 907 transitions. Word has length 97 [2024-11-07 00:34:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:43,591 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 907 transitions. [2024-11-07 00:34:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 907 transitions. [2024-11-07 00:34:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:43,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:43,593 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:43,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:34:43,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1939604839, now seen corresponding path program 1 times [2024-11-07 00:34:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38024530] [2024-11-07 00:34:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38024530] [2024-11-07 00:34:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38024530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:43,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35156366] [2024-11-07 00:34:43,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:43,879 INFO L87 Difference]: Start difference. First operand 702 states and 907 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:44,763 INFO L93 Difference]: Finished difference Result 1098 states and 1411 transitions. [2024-11-07 00:34:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:44,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:44,767 INFO L225 Difference]: With dead ends: 1098 [2024-11-07 00:34:44,767 INFO L226 Difference]: Without dead ends: 1022 [2024-11-07 00:34:44,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:44,768 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 3749 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3749 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:44,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3749 Valid, 2109 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:34:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-11-07 00:34:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 701. [2024-11-07 00:34:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.332842415316642) internal successors, (905), 700 states have internal predecessors, (905), 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) [2024-11-07 00:34:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 905 transitions. [2024-11-07 00:34:44,781 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 905 transitions. Word has length 97 [2024-11-07 00:34:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:44,781 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 905 transitions. [2024-11-07 00:34:44,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 905 transitions. [2024-11-07 00:34:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:44,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:44,783 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:34:44,783 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1267448231, now seen corresponding path program 1 times [2024-11-07 00:34:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070625630] [2024-11-07 00:34:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070625630] [2024-11-07 00:34:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070625630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:34:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813143986] [2024-11-07 00:34:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:34:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:34:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:34:45,374 INFO L87 Difference]: Start difference. First operand 701 states and 905 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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) [2024-11-07 00:34:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:47,029 INFO L93 Difference]: Finished difference Result 1533 states and 2054 transitions. [2024-11-07 00:34:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:34:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:47,033 INFO L225 Difference]: With dead ends: 1533 [2024-11-07 00:34:47,033 INFO L226 Difference]: Without dead ends: 1386 [2024-11-07 00:34:47,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:34:47,034 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 5575 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5575 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:47,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5575 Valid, 4049 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:34:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-07 00:34:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-07 00:34:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3304093567251463) internal successors, (910), 705 states have internal predecessors, (910), 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) [2024-11-07 00:34:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 910 transitions. [2024-11-07 00:34:47,045 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 910 transitions. Word has length 97 [2024-11-07 00:34:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:47,045 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 910 transitions. [2024-11-07 00:34:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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) [2024-11-07 00:34:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 910 transitions. [2024-11-07 00:34:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:34:47,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:47,047 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:47,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:34:47,047 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:47,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1888632039, now seen corresponding path program 1 times [2024-11-07 00:34:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179506244] [2024-11-07 00:34:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:47,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179506244] [2024-11-07 00:34:47,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179506244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:47,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428158683] [2024-11-07 00:34:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:47,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:47,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:47,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:47,361 INFO L87 Difference]: Start difference. First operand 706 states and 910 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:48,316 INFO L93 Difference]: Finished difference Result 1180 states and 1537 transitions. [2024-11-07 00:34:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2024-11-07 00:34:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:48,318 INFO L225 Difference]: With dead ends: 1180 [2024-11-07 00:34:48,318 INFO L226 Difference]: Without dead ends: 1076 [2024-11-07 00:34:48,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:48,319 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 4543 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4543 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:48,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4543 Valid, 2709 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:34:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-07 00:34:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 706. [2024-11-07 00:34:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3289473684210527) internal successors, (909), 705 states have internal predecessors, (909), 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) [2024-11-07 00:34:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 909 transitions. [2024-11-07 00:34:48,329 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 909 transitions. Word has length 97 [2024-11-07 00:34:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 909 transitions. [2024-11-07 00:34:48,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 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) [2024-11-07 00:34:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 909 transitions. [2024-11-07 00:34:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:48,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:48,332 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:34:48,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:48,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash -983974751, now seen corresponding path program 1 times [2024-11-07 00:34:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735577127] [2024-11-07 00:34:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735577127] [2024-11-07 00:34:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735577127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682413785] [2024-11-07 00:34:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:48,608 INFO L87 Difference]: Start difference. First operand 706 states and 909 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:49,722 INFO L93 Difference]: Finished difference Result 1180 states and 1534 transitions. [2024-11-07 00:34:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:49,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:49,724 INFO L225 Difference]: With dead ends: 1180 [2024-11-07 00:34:49,724 INFO L226 Difference]: Without dead ends: 1076 [2024-11-07 00:34:49,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:49,725 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 3081 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3081 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3081 Valid, 3296 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:34:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-07 00:34:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 706. [2024-11-07 00:34:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.327485380116959) internal successors, (908), 705 states have internal predecessors, (908), 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) [2024-11-07 00:34:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 908 transitions. [2024-11-07 00:34:49,732 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 908 transitions. Word has length 98 [2024-11-07 00:34:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:49,732 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 908 transitions. [2024-11-07 00:34:49,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 908 transitions. [2024-11-07 00:34:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:49,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:49,733 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:49,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:34:49,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:49,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1325336959, now seen corresponding path program 1 times [2024-11-07 00:34:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187819346] [2024-11-07 00:34:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:50,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187819346] [2024-11-07 00:34:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187819346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:50,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:50,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:50,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724715508] [2024-11-07 00:34:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:50,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:50,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:50,010 INFO L87 Difference]: Start difference. First operand 706 states and 908 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:50,832 INFO L93 Difference]: Finished difference Result 1145 states and 1482 transitions. [2024-11-07 00:34:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:50,835 INFO L225 Difference]: With dead ends: 1145 [2024-11-07 00:34:50,835 INFO L226 Difference]: Without dead ends: 1060 [2024-11-07 00:34:50,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:50,836 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 3967 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3967 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:50,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3967 Valid, 2594 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:34:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-07 00:34:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2024-11-07 00:34:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3260233918128654) internal successors, (907), 705 states have internal predecessors, (907), 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) [2024-11-07 00:34:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 907 transitions. [2024-11-07 00:34:50,844 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 907 transitions. Word has length 98 [2024-11-07 00:34:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:50,844 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 907 transitions. [2024-11-07 00:34:50,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 907 transitions. [2024-11-07 00:34:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:50,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:50,846 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:34:50,846 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1077039647, now seen corresponding path program 1 times [2024-11-07 00:34:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226677236] [2024-11-07 00:34:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226677236] [2024-11-07 00:34:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226677236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603469849] [2024-11-07 00:34:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:51,132 INFO L87 Difference]: Start difference. First operand 706 states and 907 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:52,153 INFO L93 Difference]: Finished difference Result 1145 states and 1481 transitions. [2024-11-07 00:34:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:52,155 INFO L225 Difference]: With dead ends: 1145 [2024-11-07 00:34:52,155 INFO L226 Difference]: Without dead ends: 1060 [2024-11-07 00:34:52,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:52,156 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 3905 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3905 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:52,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3905 Valid, 3363 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:34:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-07 00:34:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2024-11-07 00:34:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3245614035087718) internal successors, (906), 705 states have internal predecessors, (906), 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) [2024-11-07 00:34:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2024-11-07 00:34:52,164 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 98 [2024-11-07 00:34:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:52,164 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2024-11-07 00:34:52,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2024-11-07 00:34:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:52,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:52,165 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:52,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:34:52,165 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1588992191, now seen corresponding path program 1 times [2024-11-07 00:34:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531267652] [2024-11-07 00:34:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:52,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531267652] [2024-11-07 00:34:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531267652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558236166] [2024-11-07 00:34:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:52,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:52,460 INFO L87 Difference]: Start difference. First operand 706 states and 906 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:53,314 INFO L93 Difference]: Finished difference Result 1145 states and 1480 transitions. [2024-11-07 00:34:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:53,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:53,320 INFO L225 Difference]: With dead ends: 1145 [2024-11-07 00:34:53,320 INFO L226 Difference]: Without dead ends: 1060 [2024-11-07 00:34:53,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:53,321 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 3959 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3959 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:53,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3959 Valid, 2579 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:34:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-07 00:34:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2024-11-07 00:34:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3230994152046784) internal successors, (905), 705 states have internal predecessors, (905), 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) [2024-11-07 00:34:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 905 transitions. [2024-11-07 00:34:53,329 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 905 transitions. Word has length 98 [2024-11-07 00:34:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:53,329 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 905 transitions. [2024-11-07 00:34:53,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 905 transitions. [2024-11-07 00:34:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:53,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:53,331 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:53,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:34:53,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:53,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1926953537, now seen corresponding path program 1 times [2024-11-07 00:34:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847537284] [2024-11-07 00:34:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:53,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847537284] [2024-11-07 00:34:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847537284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:53,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226538632] [2024-11-07 00:34:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:53,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:53,663 INFO L87 Difference]: Start difference. First operand 706 states and 905 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:54,553 INFO L93 Difference]: Finished difference Result 1103 states and 1409 transitions. [2024-11-07 00:34:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:54,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:54,555 INFO L225 Difference]: With dead ends: 1103 [2024-11-07 00:34:54,555 INFO L226 Difference]: Without dead ends: 1027 [2024-11-07 00:34:54,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:54,556 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 4172 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4172 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:54,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4172 Valid, 2703 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:34:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2024-11-07 00:34:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 706. [2024-11-07 00:34:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3216374269005848) internal successors, (904), 705 states have internal predecessors, (904), 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) [2024-11-07 00:34:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 904 transitions. [2024-11-07 00:34:54,563 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 904 transitions. Word has length 98 [2024-11-07 00:34:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 904 transitions. [2024-11-07 00:34:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 904 transitions. [2024-11-07 00:34:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:54,564 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:34:54,565 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -650592069, now seen corresponding path program 1 times [2024-11-07 00:34:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953482457] [2024-11-07 00:34:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953482457] [2024-11-07 00:34:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953482457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004903598] [2024-11-07 00:34:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:54,788 INFO L87 Difference]: Start difference. First operand 706 states and 904 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:55,660 INFO L93 Difference]: Finished difference Result 1149 states and 1481 transitions. [2024-11-07 00:34:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:55,664 INFO L225 Difference]: With dead ends: 1149 [2024-11-07 00:34:55,664 INFO L226 Difference]: Without dead ends: 1060 [2024-11-07 00:34:55,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:55,666 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 3406 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:55,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 2588 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:34:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-07 00:34:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 706. [2024-11-07 00:34:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3201754385964912) internal successors, (903), 705 states have internal predecessors, (903), 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) [2024-11-07 00:34:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 903 transitions. [2024-11-07 00:34:55,676 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 903 transitions. Word has length 98 [2024-11-07 00:34:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:55,676 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 903 transitions. [2024-11-07 00:34:55,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 903 transitions. [2024-11-07 00:34:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:55,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:55,677 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:55,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:34:55,678 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1680548315, now seen corresponding path program 1 times [2024-11-07 00:34:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:55,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362310271] [2024-11-07 00:34:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362310271] [2024-11-07 00:34:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362310271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:55,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166008765] [2024-11-07 00:34:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:55,906 INFO L87 Difference]: Start difference. First operand 706 states and 903 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:56,920 INFO L93 Difference]: Finished difference Result 1225 states and 1593 transitions. [2024-11-07 00:34:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:34:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:56,923 INFO L225 Difference]: With dead ends: 1225 [2024-11-07 00:34:56,924 INFO L226 Difference]: Without dead ends: 1078 [2024-11-07 00:34:56,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:34:56,925 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 2748 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:56,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 3496 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:34:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-07 00:34:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 701. [2024-11-07 00:34:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.321060382916053) internal successors, (897), 700 states have internal predecessors, (897), 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) [2024-11-07 00:34:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 897 transitions. [2024-11-07 00:34:56,933 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 897 transitions. Word has length 98 [2024-11-07 00:34:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 897 transitions. [2024-11-07 00:34:56,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 897 transitions. [2024-11-07 00:34:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:34:56,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:56,934 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:34:56,934 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash -542784863, now seen corresponding path program 1 times [2024-11-07 00:34:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:56,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066172060] [2024-11-07 00:34:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066172060] [2024-11-07 00:34:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066172060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46836766] [2024-11-07 00:34:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:34:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:34:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:34:57,163 INFO L87 Difference]: Start difference. First operand 701 states and 897 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:58,114 INFO L93 Difference]: Finished difference Result 1140 states and 1470 transitions. [2024-11-07 00:34:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:34:58,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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 98 [2024-11-07 00:34:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:58,118 INFO L225 Difference]: With dead ends: 1140 [2024-11-07 00:34:58,118 INFO L226 Difference]: Without dead ends: 1055 [2024-11-07 00:34:58,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:34:58,119 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 3982 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3982 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:58,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3982 Valid, 3145 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:34:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-11-07 00:34:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 701. [2024-11-07 00:34:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3195876288659794) internal successors, (896), 700 states have internal predecessors, (896), 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) [2024-11-07 00:34:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 896 transitions. [2024-11-07 00:34:58,128 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 896 transitions. Word has length 98 [2024-11-07 00:34:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:58,128 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 896 transitions. [2024-11-07 00:34:58,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 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) [2024-11-07 00:34:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 896 transitions. [2024-11-07 00:34:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:34:58,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:58,130 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:34:58,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:34:58,130 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:34:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -308070434, now seen corresponding path program 1 times [2024-11-07 00:34:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735406224] [2024-11-07 00:34:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:34:58,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735406224] [2024-11-07 00:34:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735406224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:58,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:34:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951486707] [2024-11-07 00:34:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:58,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:34:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:34:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:34:58,587 INFO L87 Difference]: Start difference. First operand 701 states and 896 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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) [2024-11-07 00:35:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:00,189 INFO L93 Difference]: Finished difference Result 1548 states and 2054 transitions. [2024-11-07 00:35:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:00,192 INFO L225 Difference]: With dead ends: 1548 [2024-11-07 00:35:00,192 INFO L226 Difference]: Without dead ends: 1386 [2024-11-07 00:35:00,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:00,194 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 5579 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5579 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:00,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5579 Valid, 4001 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:35:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-07 00:35:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-07 00:35:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.317251461988304) internal successors, (901), 705 states have internal predecessors, (901), 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) [2024-11-07 00:35:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 901 transitions. [2024-11-07 00:35:00,207 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 901 transitions. Word has length 99 [2024-11-07 00:35:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 901 transitions. [2024-11-07 00:35:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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) [2024-11-07 00:35:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 901 transitions. [2024-11-07 00:35:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:00,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:00,208 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:00,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:35:00,209 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:00,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 234210846, now seen corresponding path program 1 times [2024-11-07 00:35:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133265625] [2024-11-07 00:35:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133265625] [2024-11-07 00:35:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133265625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483727987] [2024-11-07 00:35:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:00,492 INFO L87 Difference]: Start difference. First operand 706 states and 901 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:01,468 INFO L93 Difference]: Finished difference Result 1189 states and 1534 transitions. [2024-11-07 00:35:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:01,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:01,471 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:35:01,471 INFO L226 Difference]: Without dead ends: 1076 [2024-11-07 00:35:01,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:01,472 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 4279 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4279 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:01,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4279 Valid, 2936 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-07 00:35:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 706. [2024-11-07 00:35:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3157894736842106) internal successors, (900), 705 states have internal predecessors, (900), 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) [2024-11-07 00:35:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 900 transitions. [2024-11-07 00:35:01,479 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 900 transitions. Word has length 99 [2024-11-07 00:35:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:01,479 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 900 transitions. [2024-11-07 00:35:01,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 900 transitions. [2024-11-07 00:35:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:01,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:01,480 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:01,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:35:01,480 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:01,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -271572002, now seen corresponding path program 1 times [2024-11-07 00:35:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212622594] [2024-11-07 00:35:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212622594] [2024-11-07 00:35:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212622594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051141632] [2024-11-07 00:35:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:01,737 INFO L87 Difference]: Start difference. First operand 706 states and 900 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:02,582 INFO L93 Difference]: Finished difference Result 1108 states and 1409 transitions. [2024-11-07 00:35:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:02,585 INFO L225 Difference]: With dead ends: 1108 [2024-11-07 00:35:02,586 INFO L226 Difference]: Without dead ends: 1027 [2024-11-07 00:35:02,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:02,587 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 3516 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3516 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:02,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3516 Valid, 2269 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2024-11-07 00:35:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 706. [2024-11-07 00:35:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.314327485380117) internal successors, (899), 705 states have internal predecessors, (899), 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) [2024-11-07 00:35:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 899 transitions. [2024-11-07 00:35:02,600 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 899 transitions. Word has length 99 [2024-11-07 00:35:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 899 transitions. [2024-11-07 00:35:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 899 transitions. [2024-11-07 00:35:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:02,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:02,605 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:02,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:35:02,605 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1756072034, now seen corresponding path program 1 times [2024-11-07 00:35:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:02,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113398667] [2024-11-07 00:35:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113398667] [2024-11-07 00:35:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113398667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:02,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042728571] [2024-11-07 00:35:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:02,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:02,828 INFO L87 Difference]: Start difference. First operand 706 states and 899 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:03,736 INFO L93 Difference]: Finished difference Result 1189 states and 1530 transitions. [2024-11-07 00:35:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:03,739 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:35:03,739 INFO L226 Difference]: Without dead ends: 1076 [2024-11-07 00:35:03,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:03,740 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 4218 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:03,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 2921 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-07 00:35:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 706. [2024-11-07 00:35:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3128654970760234) internal successors, (898), 705 states have internal predecessors, (898), 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) [2024-11-07 00:35:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 898 transitions. [2024-11-07 00:35:03,747 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 898 transitions. Word has length 99 [2024-11-07 00:35:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:03,747 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 898 transitions. [2024-11-07 00:35:03,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 898 transitions. [2024-11-07 00:35:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:03,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:03,748 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:35:03,748 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 786851038, now seen corresponding path program 1 times [2024-11-07 00:35:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326931903] [2024-11-07 00:35:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326931903] [2024-11-07 00:35:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326931903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:04,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612909890] [2024-11-07 00:35:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:04,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:04,023 INFO L87 Difference]: Start difference. First operand 706 states and 898 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:04,809 INFO L93 Difference]: Finished difference Result 1033 states and 1295 transitions. [2024-11-07 00:35:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:04,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:04,811 INFO L225 Difference]: With dead ends: 1033 [2024-11-07 00:35:04,811 INFO L226 Difference]: Without dead ends: 1027 [2024-11-07 00:35:04,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:04,812 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2369 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:04,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 2269 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2024-11-07 00:35:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 706. [2024-11-07 00:35:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 684 states have (on average 1.3114035087719298) internal successors, (897), 705 states have internal predecessors, (897), 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) [2024-11-07 00:35:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 897 transitions. [2024-11-07 00:35:04,820 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 897 transitions. Word has length 99 [2024-11-07 00:35:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:04,820 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 897 transitions. [2024-11-07 00:35:04,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 897 transitions. [2024-11-07 00:35:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:04,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:04,821 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:35:04,822 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -370973194, now seen corresponding path program 1 times [2024-11-07 00:35:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896822166] [2024-11-07 00:35:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896822166] [2024-11-07 00:35:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896822166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123013087] [2024-11-07 00:35:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:05,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:05,106 INFO L87 Difference]: Start difference. First operand 706 states and 897 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:06,007 INFO L93 Difference]: Finished difference Result 1102 states and 1398 transitions. [2024-11-07 00:35:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:06,009 INFO L225 Difference]: With dead ends: 1102 [2024-11-07 00:35:06,009 INFO L226 Difference]: Without dead ends: 1026 [2024-11-07 00:35:06,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:06,011 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 4093 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:06,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 2777 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-07 00:35:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 705. [2024-11-07 00:35:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 683 states have (on average 1.3103953147877012) internal successors, (895), 704 states have internal predecessors, (895), 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) [2024-11-07 00:35:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 895 transitions. [2024-11-07 00:35:06,022 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 895 transitions. Word has length 99 [2024-11-07 00:35:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:06,023 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 895 transitions. [2024-11-07 00:35:06,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 895 transitions. [2024-11-07 00:35:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:06,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:06,024 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:35:06,024 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:06,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1320721534, now seen corresponding path program 1 times [2024-11-07 00:35:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:06,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692825836] [2024-11-07 00:35:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:06,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692825836] [2024-11-07 00:35:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692825836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601930914] [2024-11-07 00:35:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:06,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:06,265 INFO L87 Difference]: Start difference. First operand 705 states and 895 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:07,124 INFO L93 Difference]: Finished difference Result 1148 states and 1471 transitions. [2024-11-07 00:35:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:07,126 INFO L225 Difference]: With dead ends: 1148 [2024-11-07 00:35:07,126 INFO L226 Difference]: Without dead ends: 1059 [2024-11-07 00:35:07,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:07,127 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 2112 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:07,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 2803 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-07 00:35:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 705. [2024-11-07 00:35:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 683 states have (on average 1.308931185944363) internal successors, (894), 704 states have internal predecessors, (894), 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) [2024-11-07 00:35:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 894 transitions. [2024-11-07 00:35:07,135 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 894 transitions. Word has length 99 [2024-11-07 00:35:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:07,135 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 894 transitions. [2024-11-07 00:35:07,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 894 transitions. [2024-11-07 00:35:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:07,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:07,136 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:35:07,136 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:07,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 193533868, now seen corresponding path program 1 times [2024-11-07 00:35:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:07,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536118234] [2024-11-07 00:35:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:07,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:07,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536118234] [2024-11-07 00:35:07,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536118234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:07,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:07,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405678597] [2024-11-07 00:35:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:07,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:07,393 INFO L87 Difference]: Start difference. First operand 705 states and 894 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:08,279 INFO L93 Difference]: Finished difference Result 1101 states and 1395 transitions. [2024-11-07 00:35:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:08,281 INFO L225 Difference]: With dead ends: 1101 [2024-11-07 00:35:08,281 INFO L226 Difference]: Without dead ends: 1025 [2024-11-07 00:35:08,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:08,282 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 4062 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4062 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:08,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4062 Valid, 2816 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-11-07 00:35:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 704. [2024-11-07 00:35:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 682 states have (on average 1.3079178885630498) internal successors, (892), 703 states have internal predecessors, (892), 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) [2024-11-07 00:35:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 892 transitions. [2024-11-07 00:35:08,290 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 892 transitions. Word has length 99 [2024-11-07 00:35:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:08,290 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 892 transitions. [2024-11-07 00:35:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 892 transitions. [2024-11-07 00:35:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:08,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:08,291 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:08,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:35:08,291 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1237089452, now seen corresponding path program 1 times [2024-11-07 00:35:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384165755] [2024-11-07 00:35:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384165755] [2024-11-07 00:35:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384165755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524119476] [2024-11-07 00:35:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:08,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:08,562 INFO L87 Difference]: Start difference. First operand 704 states and 892 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:09,474 INFO L93 Difference]: Finished difference Result 1100 states and 1393 transitions. [2024-11-07 00:35:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:09,476 INFO L225 Difference]: With dead ends: 1100 [2024-11-07 00:35:09,476 INFO L226 Difference]: Without dead ends: 1024 [2024-11-07 00:35:09,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:09,477 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 4054 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:09,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 2816 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-11-07 00:35:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 703. [2024-11-07 00:35:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 681 states have (on average 1.3069016152716593) internal successors, (890), 702 states have internal predecessors, (890), 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) [2024-11-07 00:35:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 890 transitions. [2024-11-07 00:35:09,485 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 890 transitions. Word has length 99 [2024-11-07 00:35:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:09,485 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 890 transitions. [2024-11-07 00:35:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 890 transitions. [2024-11-07 00:35:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:09,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:09,487 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:35:09,487 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:09,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1664921314, now seen corresponding path program 1 times [2024-11-07 00:35:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:09,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279468764] [2024-11-07 00:35:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279468764] [2024-11-07 00:35:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279468764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:10,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:10,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:35:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789576016] [2024-11-07 00:35:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:10,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:10,075 INFO L87 Difference]: Start difference. First operand 703 states and 890 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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) [2024-11-07 00:35:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:10,565 INFO L93 Difference]: Finished difference Result 1162 states and 1493 transitions. [2024-11-07 00:35:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:10,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:10,567 INFO L225 Difference]: With dead ends: 1162 [2024-11-07 00:35:10,567 INFO L226 Difference]: Without dead ends: 979 [2024-11-07 00:35:10,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:35:10,568 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 3126 mSDsluCounter, 5580 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 6659 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:10,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 6659 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:35:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-07 00:35:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 595. [2024-11-07 00:35:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 574 states have (on average 1.3013937282229966) internal successors, (747), 594 states have internal predecessors, (747), 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) [2024-11-07 00:35:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 747 transitions. [2024-11-07 00:35:10,576 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 747 transitions. Word has length 99 [2024-11-07 00:35:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:10,577 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 747 transitions. [2024-11-07 00:35:10,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 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) [2024-11-07 00:35:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 747 transitions. [2024-11-07 00:35:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:10,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:10,578 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:35:10,578 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -178103298, now seen corresponding path program 1 times [2024-11-07 00:35:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168367347] [2024-11-07 00:35:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168367347] [2024-11-07 00:35:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168367347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134941064] [2024-11-07 00:35:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:11,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:11,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:11,044 INFO L87 Difference]: Start difference. First operand 595 states and 747 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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) [2024-11-07 00:35:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:12,242 INFO L93 Difference]: Finished difference Result 1211 states and 1583 transitions. [2024-11-07 00:35:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:12,244 INFO L225 Difference]: With dead ends: 1211 [2024-11-07 00:35:12,244 INFO L226 Difference]: Without dead ends: 1122 [2024-11-07 00:35:12,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:12,245 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 5635 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5635 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:12,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5635 Valid, 2723 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-07 00:35:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 600. [2024-11-07 00:35:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.298791018998273) internal successors, (752), 599 states have internal predecessors, (752), 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) [2024-11-07 00:35:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 752 transitions. [2024-11-07 00:35:12,250 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 752 transitions. Word has length 99 [2024-11-07 00:35:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:12,250 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 752 transitions. [2024-11-07 00:35:12,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 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) [2024-11-07 00:35:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2024-11-07 00:35:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:35:12,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:12,251 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:12,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:35:12,251 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:12,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -679193058, now seen corresponding path program 1 times [2024-11-07 00:35:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818776920] [2024-11-07 00:35:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818776920] [2024-11-07 00:35:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818776920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:12,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:12,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:12,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472571688] [2024-11-07 00:35:12,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:12,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:12,429 INFO L87 Difference]: Start difference. First operand 600 states and 752 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:13,147 INFO L93 Difference]: Finished difference Result 1024 states and 1306 transitions. [2024-11-07 00:35:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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 99 [2024-11-07 00:35:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:13,149 INFO L225 Difference]: With dead ends: 1024 [2024-11-07 00:35:13,149 INFO L226 Difference]: Without dead ends: 911 [2024-11-07 00:35:13,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:13,149 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 2658 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2658 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:13,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2658 Valid, 2377 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2024-11-07 00:35:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 600. [2024-11-07 00:35:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2970639032815199) internal successors, (751), 599 states have internal predecessors, (751), 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) [2024-11-07 00:35:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 751 transitions. [2024-11-07 00:35:13,157 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 751 transitions. Word has length 99 [2024-11-07 00:35:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:13,158 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 751 transitions. [2024-11-07 00:35:13,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 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) [2024-11-07 00:35:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 751 transitions. [2024-11-07 00:35:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:13,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:13,159 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:13,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:35:13,159 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:13,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1060069596, now seen corresponding path program 1 times [2024-11-07 00:35:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:13,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251583830] [2024-11-07 00:35:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251583830] [2024-11-07 00:35:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251583830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938046921] [2024-11-07 00:35:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:13,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:13,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:13,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:13,396 INFO L87 Difference]: Start difference. First operand 600 states and 751 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:14,125 INFO L93 Difference]: Finished difference Result 953 states and 1199 transitions. [2024-11-07 00:35:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:14,126 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:35:14,126 INFO L226 Difference]: Without dead ends: 875 [2024-11-07 00:35:14,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:14,127 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 3406 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:14,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 2337 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-07 00:35:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 600. [2024-11-07 00:35:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2953367875647668) internal successors, (750), 599 states have internal predecessors, (750), 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) [2024-11-07 00:35:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 750 transitions. [2024-11-07 00:35:14,133 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 750 transitions. Word has length 100 [2024-11-07 00:35:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:14,133 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 750 transitions. [2024-11-07 00:35:14,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 750 transitions. [2024-11-07 00:35:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:14,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:14,134 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:14,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:35:14,134 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:14,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash -253824772, now seen corresponding path program 1 times [2024-11-07 00:35:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539916441] [2024-11-07 00:35:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:14,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:14,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539916441] [2024-11-07 00:35:14,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539916441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:14,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:14,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868368957] [2024-11-07 00:35:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:14,350 INFO L87 Difference]: Start difference. First operand 600 states and 750 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:15,054 INFO L93 Difference]: Finished difference Result 983 states and 1249 transitions. [2024-11-07 00:35:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:15,056 INFO L225 Difference]: With dead ends: 983 [2024-11-07 00:35:15,056 INFO L226 Difference]: Without dead ends: 894 [2024-11-07 00:35:15,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:15,057 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 2654 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:15,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2654 Valid, 2385 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-07 00:35:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 600. [2024-11-07 00:35:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.293609671848014) internal successors, (749), 599 states have internal predecessors, (749), 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) [2024-11-07 00:35:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 749 transitions. [2024-11-07 00:35:15,061 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 749 transitions. Word has length 100 [2024-11-07 00:35:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 749 transitions. [2024-11-07 00:35:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 749 transitions. [2024-11-07 00:35:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:15,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:15,062 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:15,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:35:15,062 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2105960988, now seen corresponding path program 1 times [2024-11-07 00:35:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722447257] [2024-11-07 00:35:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722447257] [2024-11-07 00:35:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722447257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:15,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:15,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811942229] [2024-11-07 00:35:15,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:15,251 INFO L87 Difference]: Start difference. First operand 600 states and 749 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:15,909 INFO L93 Difference]: Finished difference Result 953 states and 1197 transitions. [2024-11-07 00:35:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:15,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:15,911 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:35:15,911 INFO L226 Difference]: Without dead ends: 875 [2024-11-07 00:35:15,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:15,912 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 1949 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:15,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 1945 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-07 00:35:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 600. [2024-11-07 00:35:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2918825561312608) internal successors, (748), 599 states have internal predecessors, (748), 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) [2024-11-07 00:35:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 748 transitions. [2024-11-07 00:35:15,916 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 748 transitions. Word has length 100 [2024-11-07 00:35:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 748 transitions. [2024-11-07 00:35:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 748 transitions. [2024-11-07 00:35:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:15,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:15,917 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:15,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 00:35:15,917 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1799923268, now seen corresponding path program 1 times [2024-11-07 00:35:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410550755] [2024-11-07 00:35:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410550755] [2024-11-07 00:35:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410550755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586799074] [2024-11-07 00:35:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:16,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:16,143 INFO L87 Difference]: Start difference. First operand 600 states and 748 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:17,008 INFO L93 Difference]: Finished difference Result 983 states and 1246 transitions. [2024-11-07 00:35:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:17,010 INFO L225 Difference]: With dead ends: 983 [2024-11-07 00:35:17,010 INFO L226 Difference]: Without dead ends: 894 [2024-11-07 00:35:17,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:17,011 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 2453 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 2587 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:17,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 2587 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-07 00:35:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 600. [2024-11-07 00:35:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2901554404145077) internal successors, (747), 599 states have internal predecessors, (747), 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) [2024-11-07 00:35:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 747 transitions. [2024-11-07 00:35:17,019 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 747 transitions. Word has length 100 [2024-11-07 00:35:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:17,019 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 747 transitions. [2024-11-07 00:35:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 747 transitions. [2024-11-07 00:35:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:17,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:17,020 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 00:35:17,021 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -41033476, now seen corresponding path program 1 times [2024-11-07 00:35:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148355794] [2024-11-07 00:35:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148355794] [2024-11-07 00:35:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148355794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968597123] [2024-11-07 00:35:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:17,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:17,313 INFO L87 Difference]: Start difference. First operand 600 states and 747 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:18,003 INFO L93 Difference]: Finished difference Result 953 states and 1195 transitions. [2024-11-07 00:35:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:18,005 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:35:18,005 INFO L226 Difference]: Without dead ends: 875 [2024-11-07 00:35:18,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:18,006 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 2649 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2649 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:18,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2649 Valid, 2429 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-07 00:35:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 600. [2024-11-07 00:35:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2884283246977548) internal successors, (746), 599 states have internal predecessors, (746), 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) [2024-11-07 00:35:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 746 transitions. [2024-11-07 00:35:18,013 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 746 transitions. Word has length 100 [2024-11-07 00:35:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:18,013 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 746 transitions. [2024-11-07 00:35:18,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 746 transitions. [2024-11-07 00:35:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:18,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:18,014 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:18,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 00:35:18,015 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:18,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 348049564, now seen corresponding path program 1 times [2024-11-07 00:35:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307081568] [2024-11-07 00:35:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:18,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307081568] [2024-11-07 00:35:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307081568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539995608] [2024-11-07 00:35:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:18,200 INFO L87 Difference]: Start difference. First operand 600 states and 746 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:18,879 INFO L93 Difference]: Finished difference Result 983 states and 1243 transitions. [2024-11-07 00:35:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:18,880 INFO L225 Difference]: With dead ends: 983 [2024-11-07 00:35:18,880 INFO L226 Difference]: Without dead ends: 894 [2024-11-07 00:35:18,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:18,881 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2604 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:18,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 2370 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-07 00:35:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 600. [2024-11-07 00:35:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2867012089810017) internal successors, (745), 599 states have internal predecessors, (745), 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) [2024-11-07 00:35:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 745 transitions. [2024-11-07 00:35:18,886 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 745 transitions. Word has length 100 [2024-11-07 00:35:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 745 transitions. [2024-11-07 00:35:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 745 transitions. [2024-11-07 00:35:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:18,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:18,888 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 00:35:18,888 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 361781404, now seen corresponding path program 1 times [2024-11-07 00:35:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646395298] [2024-11-07 00:35:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646395298] [2024-11-07 00:35:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646395298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259888618] [2024-11-07 00:35:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:19,065 INFO L87 Difference]: Start difference. First operand 600 states and 745 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:19,693 INFO L93 Difference]: Finished difference Result 953 states and 1193 transitions. [2024-11-07 00:35:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:19,695 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:35:19,695 INFO L226 Difference]: Without dead ends: 875 [2024-11-07 00:35:19,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:19,695 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 1905 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:19,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 2008 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-07 00:35:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 600. [2024-11-07 00:35:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 579 states have (on average 1.2849740932642486) internal successors, (744), 599 states have internal predecessors, (744), 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) [2024-11-07 00:35:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 744 transitions. [2024-11-07 00:35:19,702 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 744 transitions. Word has length 100 [2024-11-07 00:35:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:19,702 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 744 transitions. [2024-11-07 00:35:19,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 744 transitions. [2024-11-07 00:35:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:19,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:19,703 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:19,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 00:35:19,704 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:19,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1379458134, now seen corresponding path program 1 times [2024-11-07 00:35:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596422762] [2024-11-07 00:35:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596422762] [2024-11-07 00:35:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596422762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226812185] [2024-11-07 00:35:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:19,993 INFO L87 Difference]: Start difference. First operand 600 states and 744 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:20,838 INFO L93 Difference]: Finished difference Result 1139 states and 1446 transitions. [2024-11-07 00:35:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:20,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:20,840 INFO L225 Difference]: With dead ends: 1139 [2024-11-07 00:35:20,840 INFO L226 Difference]: Without dead ends: 977 [2024-11-07 00:35:20,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:35:20,841 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 2961 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:20,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2961 Valid, 3204 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-07 00:35:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 595. [2024-11-07 00:35:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 574 states have (on average 1.2857142857142858) internal successors, (738), 594 states have internal predecessors, (738), 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) [2024-11-07 00:35:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 738 transitions. [2024-11-07 00:35:20,848 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 738 transitions. Word has length 100 [2024-11-07 00:35:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:20,848 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 738 transitions. [2024-11-07 00:35:20,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 738 transitions. [2024-11-07 00:35:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:20,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:20,849 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:20,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 00:35:20,850 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:20,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1268155292, now seen corresponding path program 1 times [2024-11-07 00:35:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894557628] [2024-11-07 00:35:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:35:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894557628] [2024-11-07 00:35:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894557628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501785750] [2024-11-07 00:35:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:21,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:21,159 INFO L87 Difference]: Start difference. First operand 595 states and 738 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:21,913 INFO L93 Difference]: Finished difference Result 948 states and 1185 transitions. [2024-11-07 00:35:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:21,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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 100 [2024-11-07 00:35:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:21,915 INFO L225 Difference]: With dead ends: 948 [2024-11-07 00:35:21,915 INFO L226 Difference]: Without dead ends: 870 [2024-11-07 00:35:21,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:35:21,916 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 3220 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3220 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:21,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3220 Valid, 2676 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-07 00:35:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 595. [2024-11-07 00:35:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 574 states have (on average 1.28397212543554) internal successors, (737), 594 states have internal predecessors, (737), 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) [2024-11-07 00:35:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 737 transitions. [2024-11-07 00:35:21,923 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 737 transitions. Word has length 100 [2024-11-07 00:35:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:21,923 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 737 transitions. [2024-11-07 00:35:21,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 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) [2024-11-07 00:35:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 737 transitions. [2024-11-07 00:35:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:35:21,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:21,924 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:35:21,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 00:35:21,924 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1688175644, now seen corresponding path program 1 times [2024-11-07 00:35:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108161925] [2024-11-07 00:35:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat