./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.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.UNBOUNDED.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', 'b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c'] 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.UNBOUNDED.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 b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:34:46,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:34:46,428 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:46,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:34:46,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:34:46,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:34:46,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:34:46,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:34:46,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:34:46,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:34:46,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:34:46,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:34:46,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:34:46,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:34:46,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:34:46,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:34:46,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:34:46,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:34:46,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:34:46,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:34:46,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:34:46,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:34:46,472 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 -> b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c [2024-11-07 00:34:46,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:34:46,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:34:46,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:34:46,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:34:46,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:34:46,864 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.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:34:48,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:34:48,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:34:48,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:34:48,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6443f210/69c3113f4c55465f889af052353cf4a3/FLAG64fd69823 [2024-11-07 00:34:48,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6443f210/69c3113f4c55465f889af052353cf4a3 [2024-11-07 00:34:48,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:34:48,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:34:48,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:34:48,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:34:48,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:34:48,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:48" (1/1) ... [2024-11-07 00:34:48,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d767d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:48, skipping insertion in model container [2024-11-07 00:34:48,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:48" (1/1) ... [2024-11-07 00:34:48,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:34:49,305 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.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2024-11-07 00:34:49,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.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2024-11-07 00:34:49,438 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.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2024-11-07 00:34:49,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.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2024-11-07 00:34:49,468 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.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2024-11-07 00:34:49,477 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.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2024-11-07 00:34:49,569 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.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2024-11-07 00:34:49,612 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.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2024-11-07 00:34:49,635 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.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2024-11-07 00:34:49,650 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.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2024-11-07 00:34:49,658 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.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2024-11-07 00:34:49,688 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.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2024-11-07 00:34:49,703 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.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2024-11-07 00:34:49,714 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.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2024-11-07 00:34:49,723 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.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2024-11-07 00:34:49,731 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.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2024-11-07 00:34:49,738 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.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2024-11-07 00:34:49,746 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.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2024-11-07 00:34:49,752 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.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2024-11-07 00:34:49,758 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.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2024-11-07 00:34:49,765 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.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2024-11-07 00:34:49,771 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.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2024-11-07 00:34:49,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:34:49,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:34:49,955 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.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2024-11-07 00:34:49,992 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.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2024-11-07 00:34:50,014 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.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2024-11-07 00:34:50,025 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.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2024-11-07 00:34:50,030 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.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2024-11-07 00:34:50,037 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.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2024-11-07 00:34:50,087 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.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2024-11-07 00:34:50,103 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.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2024-11-07 00:34:50,113 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.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2024-11-07 00:34:50,119 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.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2024-11-07 00:34:50,124 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.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2024-11-07 00:34:50,142 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.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2024-11-07 00:34:50,152 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.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2024-11-07 00:34:50,157 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.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2024-11-07 00:34:50,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.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2024-11-07 00:34:50,169 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.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2024-11-07 00:34:50,174 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.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2024-11-07 00:34:50,179 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.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2024-11-07 00:34:50,184 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.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2024-11-07 00:34:50,189 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.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2024-11-07 00:34:50,194 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.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2024-11-07 00:34:50,199 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.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2024-11-07 00:34:50,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:34:50,263 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:34:50,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:50 WrapperNode [2024-11-07 00:34:50,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:34:50,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:34:50,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:34:50,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:34:50,272 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:50" (1/1) ... [2024-11-07 00:34:50,320 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:50" (1/1) ... [2024-11-07 00:34:50,543 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12202 [2024-11-07 00:34:50,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:34:50,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:34:50,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:34:50,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:34:50,553 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:50" (1/1) ... [2024-11-07 00:34:50,553 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:50" (1/1) ... [2024-11-07 00:34:50,584 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:50" (1/1) ... [2024-11-07 00:34:50,656 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:50,657 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:50" (1/1) ... [2024-11-07 00:34:50,657 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:50" (1/1) ... [2024-11-07 00:34:50,767 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:50" (1/1) ... [2024-11-07 00:34:50,832 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:50" (1/1) ... [2024-11-07 00:34:50,869 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:50" (1/1) ... [2024-11-07 00:34:50,926 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:50" (1/1) ... [2024-11-07 00:34:50,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:34:50,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:34:50,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:34:50,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:34:50,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:50" (1/1) ... [2024-11-07 00:34:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:34:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:34:51,004 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:51,017 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:51,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:34:51,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:34:51,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:34:51,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:34:51,331 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:34:51,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:34:56,185 INFO L? ?]: Removed 2222 outVars from TransFormulas that were not future-live. [2024-11-07 00:34:56,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:34:56,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:34:56,241 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:34:56,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:56 BoogieIcfgContainer [2024-11-07 00:34:56,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:34:56,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:34:56,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:34:56,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:34:56,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:48" (1/3) ... [2024-11-07 00:34:56,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77107954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:56, skipping insertion in model container [2024-11-07 00:34:56,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:50" (2/3) ... [2024-11-07 00:34:56,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77107954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:56, skipping insertion in model container [2024-11-07 00:34:56,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:56" (3/3) ... [2024-11-07 00:34:56,250 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:34:56,260 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:34:56,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 00:34:56,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:34:56,382 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;@513b089e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:34:56,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 00:34:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 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,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:34:56,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:56,421 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] [2024-11-07 00:34:56,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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:56,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash 945954769, now seen corresponding path program 1 times [2024-11-07 00:34:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426894621] [2024-11-07 00:34:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:57,031 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,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:57,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426894621] [2024-11-07 00:34:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426894621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001408091] [2024-11-07 00:34:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:57,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:57,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:57,063 INFO L87 Difference]: Start difference. First operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 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.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:58,358 INFO L93 Difference]: Finished difference Result 2546 states and 4528 transitions. [2024-11-07 00:34:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 00:34:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:58,382 INFO L225 Difference]: With dead ends: 2546 [2024-11-07 00:34:58,383 INFO L226 Difference]: Without dead ends: 1401 [2024-11-07 00:34:58,388 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:58,393 INFO L432 NwaCegarLoop]: 1367 mSDtfsCounter, 7255 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7255 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:58,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7255 Valid, 1445 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:34:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-07 00:34:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2024-11-07 00:34:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1379 states have (on average 1.3038433647570704) internal successors, (1798), 1400 states have internal predecessors, (1798), 0 states have call successors, (0), 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,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1798 transitions. [2024-11-07 00:34:58,476 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1798 transitions. Word has length 86 [2024-11-07 00:34:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:58,477 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1798 transitions. [2024-11-07 00:34:58,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1798 transitions. [2024-11-07 00:34:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:34:58,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:58,483 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] [2024-11-07 00:34:58,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:34:58,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:58,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -340795257, now seen corresponding path program 1 times [2024-11-07 00:34:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133389698] [2024-11-07 00:34:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:58,696 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,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133389698] [2024-11-07 00:34:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133389698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723985965] [2024-11-07 00:34:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:58,699 INFO L87 Difference]: Start difference. First operand 1401 states and 1798 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:59,306 INFO L93 Difference]: Finished difference Result 1672 states and 2149 transitions. [2024-11-07 00:34:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:34:59,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 00:34:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:59,311 INFO L225 Difference]: With dead ends: 1672 [2024-11-07 00:34:59,311 INFO L226 Difference]: Without dead ends: 969 [2024-11-07 00:34:59,312 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:59,313 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 3667 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3667 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:59,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3667 Valid, 654 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:34:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-07 00:34:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2024-11-07 00:34:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 947 states have (on average 1.3231256599788808) internal successors, (1253), 968 states have internal predecessors, (1253), 0 states have call successors, (0), 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:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1253 transitions. [2024-11-07 00:34:59,350 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1253 transitions. Word has length 86 [2024-11-07 00:34:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:59,350 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1253 transitions. [2024-11-07 00:34:59,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1253 transitions. [2024-11-07 00:34:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:34:59,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:59,357 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] [2024-11-07 00:34:59,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:34:59,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1383981291, now seen corresponding path program 1 times [2024-11-07 00:34:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401558166] [2024-11-07 00:34:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:59,519 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:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401558166] [2024-11-07 00:34:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401558166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:34:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883293880] [2024-11-07 00:34:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:34:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:34:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:34:59,521 INFO L87 Difference]: Start difference. First operand 969 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:00,000 INFO L93 Difference]: Finished difference Result 1343 states and 1758 transitions. [2024-11-07 00:35:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:35:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 00:35:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:00,006 INFO L225 Difference]: With dead ends: 1343 [2024-11-07 00:35:00,006 INFO L226 Difference]: Without dead ends: 828 [2024-11-07 00:35:00,008 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:35:00,009 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 3216 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3216 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:00,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3216 Valid, 571 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:35:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-07 00:35:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2024-11-07 00:35:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 806 states have (on average 1.3535980148883375) internal successors, (1091), 827 states have internal predecessors, (1091), 0 states have call successors, (0), 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,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1091 transitions. [2024-11-07 00:35:00,028 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1091 transitions. Word has length 86 [2024-11-07 00:35:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:00,028 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1091 transitions. [2024-11-07 00:35:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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,028 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1091 transitions. [2024-11-07 00:35:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:35:00,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:00,031 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:35:00,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:35:00,032 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:35:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -100915319, now seen corresponding path program 1 times [2024-11-07 00:35:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994378705] [2024-11-07 00:35:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:00,297 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,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994378705] [2024-11-07 00:35:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994378705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:35:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398460536] [2024-11-07 00:35:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:35:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:35:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:35:00,298 INFO L87 Difference]: Start difference. First operand 828 states and 1091 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:35:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:00,683 INFO L93 Difference]: Finished difference Result 1171 states and 1548 transitions. [2024-11-07 00:35:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:35:00,683 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:35:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:00,685 INFO L225 Difference]: With dead ends: 1171 [2024-11-07 00:35:00,685 INFO L226 Difference]: Without dead ends: 727 [2024-11-07 00:35:00,686 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:35:00,686 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 2833 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:00,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 528 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:35:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-07 00:35:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-11-07 00:35:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 705 states have (on average 1.371631205673759) internal successors, (967), 726 states have internal predecessors, (967), 0 states have call successors, (0), 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,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 967 transitions. [2024-11-07 00:35:00,699 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 967 transitions. Word has length 87 [2024-11-07 00:35:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 967 transitions. [2024-11-07 00:35:00,700 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:35:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 967 transitions. [2024-11-07 00:35:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 00:35:00,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:00,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] [2024-11-07 00:35:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:35:00,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:00,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -881369892, now seen corresponding path program 1 times [2024-11-07 00:35:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059659936] [2024-11-07 00:35:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:00,864 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,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059659936] [2024-11-07 00:35:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059659936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:35:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874391421] [2024-11-07 00:35:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:35:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:35:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:35:00,865 INFO L87 Difference]: Start difference. First operand 727 states and 967 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:01,241 INFO L93 Difference]: Finished difference Result 1038 states and 1379 transitions. [2024-11-07 00:35:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:35:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-07 00:35:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:01,245 INFO L225 Difference]: With dead ends: 1038 [2024-11-07 00:35:01,245 INFO L226 Difference]: Without dead ends: 646 [2024-11-07 00:35:01,248 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:35:01,249 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 2507 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2507 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:01,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2507 Valid, 495 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:35:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-07 00:35:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2024-11-07 00:35:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3814102564102564) internal successors, (862), 645 states have internal predecessors, (862), 0 states have call successors, (0), 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,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 862 transitions. [2024-11-07 00:35:01,272 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 862 transitions. Word has length 88 [2024-11-07 00:35:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:01,272 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 862 transitions. [2024-11-07 00:35:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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,272 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 862 transitions. [2024-11-07 00:35:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 00:35:01,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:01,273 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:35:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:35:01,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash -15019222, now seen corresponding path program 1 times [2024-11-07 00:35:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526317588] [2024-11-07 00:35:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:01,450 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526317588] [2024-11-07 00:35:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526317588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:35:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623472093] [2024-11-07 00:35:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:35:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:35:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:35:01,453 INFO L87 Difference]: Start difference. First operand 646 states and 862 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:35:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:01,960 INFO L93 Difference]: Finished difference Result 992 states and 1329 transitions. [2024-11-07 00:35:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:35:01,961 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:35:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:01,963 INFO L225 Difference]: With dead ends: 992 [2024-11-07 00:35:01,964 INFO L226 Difference]: Without dead ends: 638 [2024-11-07 00:35:01,964 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:35:01,965 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 2416 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:01,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 420 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-07 00:35:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-07 00:35:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3831168831168832) internal successors, (852), 637 states have internal predecessors, (852), 0 states have call successors, (0), 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,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 852 transitions. [2024-11-07 00:35:01,978 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 852 transitions. Word has length 89 [2024-11-07 00:35:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 852 transitions. [2024-11-07 00:35:01,979 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:35:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 852 transitions. [2024-11-07 00:35:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:35:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:01,981 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] [2024-11-07 00:35:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:35:01,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1223915583, now seen corresponding path program 1 times [2024-11-07 00:35:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504482438] [2024-11-07 00:35:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:02,353 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,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504482438] [2024-11-07 00:35:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504482438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:02,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882440166] [2024-11-07 00:35:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:02,355 INFO L87 Difference]: Start difference. First operand 638 states and 852 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:03,445 INFO L93 Difference]: Finished difference Result 1179 states and 1593 transitions. [2024-11-07 00:35:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 00:35:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:03,450 INFO L225 Difference]: With dead ends: 1179 [2024-11-07 00:35:03,450 INFO L226 Difference]: Without dead ends: 987 [2024-11-07 00:35:03,451 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:03,452 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 3520 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3520 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:03,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3520 Valid, 2087 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-07 00:35:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 638. [2024-11-07 00:35:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3814935064935066) internal successors, (851), 637 states have internal predecessors, (851), 0 states have call successors, (0), 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,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 851 transitions. [2024-11-07 00:35:03,466 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 851 transitions. Word has length 90 [2024-11-07 00:35:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 851 transitions. [2024-11-07 00:35:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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,466 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 851 transitions. [2024-11-07 00:35:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:35:03,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:03,468 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] [2024-11-07 00:35:03,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:35:03,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:03,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -774148364, now seen corresponding path program 1 times [2024-11-07 00:35:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758913250] [2024-11-07 00:35:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:03,864 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:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:03,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758913250] [2024-11-07 00:35:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758913250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82492263] [2024-11-07 00:35:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:03,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:03,867 INFO L87 Difference]: Start difference. First operand 638 states and 851 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:05,056 INFO L93 Difference]: Finished difference Result 1106 states and 1496 transitions. [2024-11-07 00:35:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 00:35:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:05,059 INFO L225 Difference]: With dead ends: 1106 [2024-11-07 00:35:05,059 INFO L226 Difference]: Without dead ends: 982 [2024-11-07 00:35:05,060 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:05,060 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 2890 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:05,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 2729 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:35:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-07 00:35:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2024-11-07 00:35:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37987012987013) internal successors, (850), 637 states have internal predecessors, (850), 0 states have call successors, (0), 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:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 850 transitions. [2024-11-07 00:35:05,073 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 850 transitions. Word has length 90 [2024-11-07 00:35:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 850 transitions. [2024-11-07 00:35:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 850 transitions. [2024-11-07 00:35:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:35:05,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:05,074 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] [2024-11-07 00:35:05,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:35:05,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1127184379, now seen corresponding path program 1 times [2024-11-07 00:35:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868281709] [2024-11-07 00:35:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:05,439 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,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868281709] [2024-11-07 00:35:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868281709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 00:35:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40241661] [2024-11-07 00:35:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:05,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:35:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:35:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:35:05,441 INFO L87 Difference]: Start difference. First operand 638 states and 850 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:06,420 INFO L93 Difference]: Finished difference Result 930 states and 1216 transitions. [2024-11-07 00:35:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 00:35:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:06,424 INFO L225 Difference]: With dead ends: 930 [2024-11-07 00:35:06,424 INFO L226 Difference]: Without dead ends: 925 [2024-11-07 00:35:06,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:35:06,427 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 3489 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:06,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 2493 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-07 00:35:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 638. [2024-11-07 00:35:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3782467532467533) internal successors, (849), 637 states have internal predecessors, (849), 0 states have call successors, (0), 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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 849 transitions. [2024-11-07 00:35:06,441 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 849 transitions. Word has length 90 [2024-11-07 00:35:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 849 transitions. [2024-11-07 00:35:06,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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,441 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 849 transitions. [2024-11-07 00:35:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:35:06,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:06,443 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] [2024-11-07 00:35:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:35:06,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash 920548212, now seen corresponding path program 1 times [2024-11-07 00:35:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942602915] [2024-11-07 00:35:06,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:06,802 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,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942602915] [2024-11-07 00:35:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942602915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:06,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 00:35:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953207344] [2024-11-07 00:35:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:06,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:35:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:35:06,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:35:06,804 INFO L87 Difference]: Start difference. First operand 638 states and 849 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:07,822 INFO L93 Difference]: Finished difference Result 1043 states and 1390 transitions. [2024-11-07 00:35:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:35:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 00:35:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:07,825 INFO L225 Difference]: With dead ends: 1043 [2024-11-07 00:35:07,825 INFO L226 Difference]: Without dead ends: 957 [2024-11-07 00:35:07,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:07,826 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 3483 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3483 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:07,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3483 Valid, 2751 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-11-07 00:35:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 638. [2024-11-07 00:35:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3766233766233766) internal successors, (848), 637 states have internal predecessors, (848), 0 states have call successors, (0), 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,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 848 transitions. [2024-11-07 00:35:07,836 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 848 transitions. Word has length 90 [2024-11-07 00:35:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 848 transitions. [2024-11-07 00:35:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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,837 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 848 transitions. [2024-11-07 00:35:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:35:07,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:07,838 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] [2024-11-07 00:35:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:35:07,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -93518206, now seen corresponding path program 1 times [2024-11-07 00:35:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854166848] [2024-11-07 00:35:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:08,143 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,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854166848] [2024-11-07 00:35:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854166848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:35:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262932762] [2024-11-07 00:35:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:35:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:35:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:35:08,145 INFO L87 Difference]: Start difference. First operand 638 states and 848 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:08,872 INFO L93 Difference]: Finished difference Result 1201 states and 1556 transitions. [2024-11-07 00:35:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:35:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 00:35:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:08,874 INFO L225 Difference]: With dead ends: 1201 [2024-11-07 00:35:08,874 INFO L226 Difference]: Without dead ends: 855 [2024-11-07 00:35:08,875 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:35:08,875 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 3913 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3913 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:08,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3913 Valid, 1390 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-07 00:35:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 638. [2024-11-07 00:35:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.375) internal successors, (847), 637 states have internal predecessors, (847), 0 states have call successors, (0), 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,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 847 transitions. [2024-11-07 00:35:08,887 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 847 transitions. Word has length 90 [2024-11-07 00:35:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 847 transitions. [2024-11-07 00:35:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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,888 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 847 transitions. [2024-11-07 00:35:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:08,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:08,889 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] [2024-11-07 00:35:08,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:35:08,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1699433639, now seen corresponding path program 1 times [2024-11-07 00:35:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99450941] [2024-11-07 00:35:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:09,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:35:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99450941] [2024-11-07 00:35:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99450941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:09,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825169985] [2024-11-07 00:35:09,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:09,132 INFO L87 Difference]: Start difference. First operand 638 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:10,080 INFO L93 Difference]: Finished difference Result 1120 states and 1502 transitions. [2024-11-07 00:35:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:10,083 INFO L225 Difference]: With dead ends: 1120 [2024-11-07 00:35:10,083 INFO L226 Difference]: Without dead ends: 982 [2024-11-07 00:35:10,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:10,084 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 4316 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:10,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 2450 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-07 00:35:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2024-11-07 00:35:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3733766233766234) internal successors, (846), 637 states have internal predecessors, (846), 0 states have call successors, (0), 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,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 846 transitions. [2024-11-07 00:35:10,092 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 846 transitions. Word has length 92 [2024-11-07 00:35:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:10,092 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 846 transitions. [2024-11-07 00:35:10,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,092 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 846 transitions. [2024-11-07 00:35:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:10,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:10,093 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] [2024-11-07 00:35:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:35:10,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 510204798, now seen corresponding path program 1 times [2024-11-07 00:35:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443756620] [2024-11-07 00:35:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:10,430 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,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443756620] [2024-11-07 00:35:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443756620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071723207] [2024-11-07 00:35:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:10,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:10,432 INFO L87 Difference]: Start difference. First operand 638 states and 846 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:11,573 INFO L93 Difference]: Finished difference Result 1098 states and 1464 transitions. [2024-11-07 00:35:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:35:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:11,576 INFO L225 Difference]: With dead ends: 1098 [2024-11-07 00:35:11,576 INFO L226 Difference]: Without dead ends: 990 [2024-11-07 00:35:11,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:35:11,577 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 2940 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2940 SdHoareTripleChecker+Valid, 2886 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:11,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2940 Valid, 2886 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:35:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-07 00:35:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 645. [2024-11-07 00:35:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3739967897271268) internal successors, (856), 644 states have internal predecessors, (856), 0 states have call successors, (0), 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:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 856 transitions. [2024-11-07 00:35:11,588 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 856 transitions. Word has length 92 [2024-11-07 00:35:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:11,588 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 856 transitions. [2024-11-07 00:35:11,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 856 transitions. [2024-11-07 00:35:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:11,590 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] [2024-11-07 00:35:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:35:11,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1703020528, now seen corresponding path program 1 times [2024-11-07 00:35:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111589068] [2024-11-07 00:35:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:12,038 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,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111589068] [2024-11-07 00:35:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111589068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445719716] [2024-11-07 00:35:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:12,041 INFO L87 Difference]: Start difference. First operand 645 states and 856 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:13,264 INFO L93 Difference]: Finished difference Result 1073 states and 1413 transitions. [2024-11-07 00:35:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:35:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:13,267 INFO L225 Difference]: With dead ends: 1073 [2024-11-07 00:35:13,267 INFO L226 Difference]: Without dead ends: 994 [2024-11-07 00:35:13,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:35:13,268 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 4635 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:13,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 3045 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:35:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-07 00:35:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 655. [2024-11-07 00:35:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3759873617693523) internal successors, (871), 654 states have internal predecessors, (871), 0 states have call successors, (0), 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,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 871 transitions. [2024-11-07 00:35:13,279 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 871 transitions. Word has length 92 [2024-11-07 00:35:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 871 transitions. [2024-11-07 00:35:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,279 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 871 transitions. [2024-11-07 00:35:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:13,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:13,281 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] [2024-11-07 00:35:13,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:35:13,281 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1374407572, now seen corresponding path program 1 times [2024-11-07 00:35:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:13,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574306068] [2024-11-07 00:35:13,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:13,578 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,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574306068] [2024-11-07 00:35:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574306068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660591564] [2024-11-07 00:35:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:13,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:13,580 INFO L87 Difference]: Start difference. First operand 655 states and 871 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:14,894 INFO L93 Difference]: Finished difference Result 1154 states and 1545 transitions. [2024-11-07 00:35:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:35:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:14,897 INFO L225 Difference]: With dead ends: 1154 [2024-11-07 00:35:14,897 INFO L226 Difference]: Without dead ends: 1001 [2024-11-07 00:35:14,897 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:35:14,897 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 2954 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2954 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:14,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2954 Valid, 3705 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:35:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-07 00:35:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 655. [2024-11-07 00:35:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3744075829383886) internal successors, (870), 654 states have internal predecessors, (870), 0 states have call successors, (0), 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,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 870 transitions. [2024-11-07 00:35:14,904 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 870 transitions. Word has length 92 [2024-11-07 00:35:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:14,904 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 870 transitions. [2024-11-07 00:35:14,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,905 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 870 transitions. [2024-11-07 00:35:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:14,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:14,906 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] [2024-11-07 00:35:14,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:35:14,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -496473703, now seen corresponding path program 1 times [2024-11-07 00:35:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342849802] [2024-11-07 00:35:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:15,092 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,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:15,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342849802] [2024-11-07 00:35:15,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342849802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:15,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361578280] [2024-11-07 00:35:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:15,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:15,093 INFO L87 Difference]: Start difference. First operand 655 states and 870 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:16,067 INFO L93 Difference]: Finished difference Result 1091 states and 1460 transitions. [2024-11-07 00:35:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:16,070 INFO L225 Difference]: With dead ends: 1091 [2024-11-07 00:35:16,070 INFO L226 Difference]: Without dead ends: 992 [2024-11-07 00:35:16,071 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:35:16,071 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2885 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2885 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:16,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2885 Valid, 2876 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-07 00:35:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 655. [2024-11-07 00:35:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3728278041074249) internal successors, (869), 654 states have internal predecessors, (869), 0 states have call successors, (0), 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:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 869 transitions. [2024-11-07 00:35:16,080 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 869 transitions. Word has length 92 [2024-11-07 00:35:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:16,082 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 869 transitions. [2024-11-07 00:35:16,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 869 transitions. [2024-11-07 00:35:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:16,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:16,083 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] [2024-11-07 00:35:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:35:16,083 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2138746040, now seen corresponding path program 1 times [2024-11-07 00:35:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907263805] [2024-11-07 00:35:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:16,372 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,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907263805] [2024-11-07 00:35:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907263805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944794894] [2024-11-07 00:35:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:16,374 INFO L87 Difference]: Start difference. First operand 655 states and 869 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:17,140 INFO L93 Difference]: Finished difference Result 1086 states and 1454 transitions. [2024-11-07 00:35:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:17,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:17,143 INFO L225 Difference]: With dead ends: 1086 [2024-11-07 00:35:17,143 INFO L226 Difference]: Without dead ends: 992 [2024-11-07 00:35:17,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:17,144 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 4303 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:17,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4303 Valid, 2374 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-07 00:35:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 655. [2024-11-07 00:35:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3712480252764614) internal successors, (868), 654 states have internal predecessors, (868), 0 states have call successors, (0), 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,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 868 transitions. [2024-11-07 00:35:17,154 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 868 transitions. Word has length 92 [2024-11-07 00:35:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:17,154 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 868 transitions. [2024-11-07 00:35:17,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,154 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 868 transitions. [2024-11-07 00:35:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:17,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:17,156 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] [2024-11-07 00:35:17,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:35:17,156 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:35:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1951823708, now seen corresponding path program 1 times [2024-11-07 00:35:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:17,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571711508] [2024-11-07 00:35:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:17,331 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,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571711508] [2024-11-07 00:35:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571711508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3029072] [2024-11-07 00:35:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:17,333 INFO L87 Difference]: Start difference. First operand 655 states and 868 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:17,987 INFO L93 Difference]: Finished difference Result 1062 states and 1412 transitions. [2024-11-07 00:35:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:17,990 INFO L225 Difference]: With dead ends: 1062 [2024-11-07 00:35:17,990 INFO L226 Difference]: Without dead ends: 976 [2024-11-07 00:35:17,990 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:17,990 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 3330 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:17,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 2116 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-07 00:35:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 655. [2024-11-07 00:35:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3696682464454977) internal successors, (867), 654 states have internal predecessors, (867), 0 states have call successors, (0), 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,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 867 transitions. [2024-11-07 00:35:17,997 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 867 transitions. Word has length 92 [2024-11-07 00:35:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:17,997 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 867 transitions. [2024-11-07 00:35:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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,997 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 867 transitions. [2024-11-07 00:35:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 00:35:17,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:17,998 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] [2024-11-07 00:35:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:35:17,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -761353428, now seen corresponding path program 1 times [2024-11-07 00:35:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464995445] [2024-11-07 00:35:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:18,322 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,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464995445] [2024-11-07 00:35:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464995445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317203684] [2024-11-07 00:35:18,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:18,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:18,323 INFO L87 Difference]: Start difference. First operand 655 states and 867 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:19,709 INFO L93 Difference]: Finished difference Result 1439 states and 1971 transitions. [2024-11-07 00:35:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:19,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 00:35:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:19,713 INFO L225 Difference]: With dead ends: 1439 [2024-11-07 00:35:19,713 INFO L226 Difference]: Without dead ends: 1301 [2024-11-07 00:35:19,713 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:19,714 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 5432 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 3194 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5432 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:19,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5432 Valid, 3907 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:35:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-07 00:35:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 659. [2024-11-07 00:35:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.3673469387755102) internal successors, (871), 658 states have internal predecessors, (871), 0 states have call successors, (0), 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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 871 transitions. [2024-11-07 00:35:19,721 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 871 transitions. Word has length 92 [2024-11-07 00:35:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 871 transitions. [2024-11-07 00:35:19,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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,721 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 871 transitions. [2024-11-07 00:35:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:35:19,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:19,722 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:35:19,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:35:19,722 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash -860313180, now seen corresponding path program 1 times [2024-11-07 00:35:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836349466] [2024-11-07 00:35:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:20,010 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:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836349466] [2024-11-07 00:35:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836349466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515906119] [2024-11-07 00:35:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:20,012 INFO L87 Difference]: Start difference. First operand 659 states and 871 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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:35:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:20,911 INFO L93 Difference]: Finished difference Result 1137 states and 1524 transitions. [2024-11-07 00:35:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:20,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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:35:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:20,913 INFO L225 Difference]: With dead ends: 1137 [2024-11-07 00:35:20,913 INFO L226 Difference]: Without dead ends: 999 [2024-11-07 00:35:20,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:35:20,914 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 3578 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3578 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:20,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3578 Valid, 2985 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-11-07 00:35:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 655. [2024-11-07 00:35:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.368088467614534) internal successors, (866), 654 states have internal predecessors, (866), 0 states have call successors, (0), 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,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 866 transitions. [2024-11-07 00:35:20,921 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 866 transitions. Word has length 93 [2024-11-07 00:35:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 866 transitions. [2024-11-07 00:35:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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:35:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 866 transitions. [2024-11-07 00:35:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:20,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:20,922 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] [2024-11-07 00:35:20,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:35:20,922 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:20,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1776369767, now seen corresponding path program 1 times [2024-11-07 00:35:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906209903] [2024-11-07 00:35:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:21,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906209903] [2024-11-07 00:35:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906209903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:21,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17359562] [2024-11-07 00:35:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:21,139 INFO L87 Difference]: Start difference. First operand 655 states and 866 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:21,887 INFO L93 Difference]: Finished difference Result 1100 states and 1464 transitions. [2024-11-07 00:35:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:21,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:21,889 INFO L225 Difference]: With dead ends: 1100 [2024-11-07 00:35:21,889 INFO L226 Difference]: Without dead ends: 992 [2024-11-07 00:35:21,890 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:21,890 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 2786 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:21,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2786 Valid, 2833 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-07 00:35:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 655. [2024-11-07 00:35:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3665086887835702) internal successors, (865), 654 states have internal predecessors, (865), 0 states have call successors, (0), 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,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 865 transitions. [2024-11-07 00:35:21,896 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 865 transitions. Word has length 94 [2024-11-07 00:35:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:21,896 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 865 transitions. [2024-11-07 00:35:21,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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,896 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 865 transitions. [2024-11-07 00:35:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:21,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:21,897 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] [2024-11-07 00:35:21,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:35:21,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -583554037, now seen corresponding path program 1 times [2024-11-07 00:35:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429454532] [2024-11-07 00:35:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:22,086 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:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429454532] [2024-11-07 00:35:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429454532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059619253] [2024-11-07 00:35:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:22,087 INFO L87 Difference]: Start difference. First operand 655 states and 865 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:22,753 INFO L93 Difference]: Finished difference Result 1027 states and 1347 transitions. [2024-11-07 00:35:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:22,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:22,756 INFO L225 Difference]: With dead ends: 1027 [2024-11-07 00:35:22,756 INFO L226 Difference]: Without dead ends: 948 [2024-11-07 00:35:22,757 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:22,758 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 3347 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3347 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:22,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3347 Valid, 1933 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-07 00:35:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 641. [2024-11-07 00:35:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3618739903069468) internal successors, (843), 640 states have internal predecessors, (843), 0 states have call successors, (0), 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:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 843 transitions. [2024-11-07 00:35:22,764 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 843 transitions. Word has length 94 [2024-11-07 00:35:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:22,764 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 843 transitions. [2024-11-07 00:35:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 843 transitions. [2024-11-07 00:35:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:22,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:22,766 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] [2024-11-07 00:35:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:35:22,767 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:22,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -912166993, now seen corresponding path program 1 times [2024-11-07 00:35:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083867654] [2024-11-07 00:35:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:23,051 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:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083867654] [2024-11-07 00:35:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083867654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:23,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:23,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146433862] [2024-11-07 00:35:23,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:23,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:23,054 INFO L87 Difference]: Start difference. First operand 641 states and 843 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:24,409 INFO L93 Difference]: Finished difference Result 1440 states and 1957 transitions. [2024-11-07 00:35:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:24,412 INFO L225 Difference]: With dead ends: 1440 [2024-11-07 00:35:24,412 INFO L226 Difference]: Without dead ends: 1287 [2024-11-07 00:35:24,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:24,413 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 5612 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5612 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:24,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5612 Valid, 3743 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 3074 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:35:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-07 00:35:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 642. [2024-11-07 00:35:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3612903225806452) internal successors, (844), 641 states have internal predecessors, (844), 0 states have call successors, (0), 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:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 844 transitions. [2024-11-07 00:35:24,419 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 844 transitions. Word has length 94 [2024-11-07 00:35:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:24,419 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 844 transitions. [2024-11-07 00:35:24,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 844 transitions. [2024-11-07 00:35:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:24,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:24,420 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] [2024-11-07 00:35:24,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:35:24,420 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:24,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash -905490814, now seen corresponding path program 1 times [2024-11-07 00:35:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:24,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157641307] [2024-11-07 00:35:24,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:24,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:24,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:35:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157641307] [2024-11-07 00:35:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157641307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567111698] [2024-11-07 00:35:24,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:24,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:24,587 INFO L87 Difference]: Start difference. First operand 642 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:25,340 INFO L93 Difference]: Finished difference Result 1087 states and 1440 transitions. [2024-11-07 00:35:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:25,343 INFO L225 Difference]: With dead ends: 1087 [2024-11-07 00:35:25,343 INFO L226 Difference]: Without dead ends: 979 [2024-11-07 00:35:25,343 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:25,344 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 2297 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:25,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 2799 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-07 00:35:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 642. [2024-11-07 00:35:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3596774193548387) internal successors, (843), 641 states have internal predecessors, (843), 0 states have call successors, (0), 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:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 843 transitions. [2024-11-07 00:35:25,351 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 843 transitions. Word has length 94 [2024-11-07 00:35:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:25,351 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 843 transitions. [2024-11-07 00:35:25,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 843 transitions. [2024-11-07 00:35:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:25,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:25,352 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] [2024-11-07 00:35:25,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:35:25,352 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 930696, now seen corresponding path program 1 times [2024-11-07 00:35:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386185333] [2024-11-07 00:35:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:25,552 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:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:25,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386185333] [2024-11-07 00:35:25,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386185333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823343040] [2024-11-07 00:35:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:25,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:25,554 INFO L87 Difference]: Start difference. First operand 642 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:26,347 INFO L93 Difference]: Finished difference Result 1078 states and 1430 transitions. [2024-11-07 00:35:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:26,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:26,349 INFO L225 Difference]: With dead ends: 1078 [2024-11-07 00:35:26,349 INFO L226 Difference]: Without dead ends: 979 [2024-11-07 00:35:26,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:35:26,350 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 3732 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3732 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:26,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3732 Valid, 2814 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-07 00:35:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 642. [2024-11-07 00:35:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3580645161290323) internal successors, (842), 641 states have internal predecessors, (842), 0 states have call successors, (0), 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:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 842 transitions. [2024-11-07 00:35:26,356 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 842 transitions. Word has length 94 [2024-11-07 00:35:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:26,356 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 842 transitions. [2024-11-07 00:35:26,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 842 transitions. [2024-11-07 00:35:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:26,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:26,357 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] [2024-11-07 00:35:26,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:35:26,357 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:35:26,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 389206872, now seen corresponding path program 1 times [2024-11-07 00:35:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244384541] [2024-11-07 00:35:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:26,551 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:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244384541] [2024-11-07 00:35:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244384541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:26,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34895474] [2024-11-07 00:35:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:26,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:26,554 INFO L87 Difference]: Start difference. First operand 642 states and 842 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:27,300 INFO L93 Difference]: Finished difference Result 1045 states and 1381 transitions. [2024-11-07 00:35:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:27,303 INFO L225 Difference]: With dead ends: 1045 [2024-11-07 00:35:27,303 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:27,303 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:27,303 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2850 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:27,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 2641 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3564516129032258) internal successors, (841), 641 states have internal predecessors, (841), 0 states have call successors, (0), 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:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 841 transitions. [2024-11-07 00:35:27,309 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 841 transitions. Word has length 94 [2024-11-07 00:35:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:27,309 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 841 transitions. [2024-11-07 00:35:27,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 841 transitions. [2024-11-07 00:35:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:27,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:27,310 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] [2024-11-07 00:35:27,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:35:27,310 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 754402265, now seen corresponding path program 1 times [2024-11-07 00:35:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390641348] [2024-11-07 00:35:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:27,465 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:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390641348] [2024-11-07 00:35:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390641348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860904042] [2024-11-07 00:35:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:27,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:27,466 INFO L87 Difference]: Start difference. First operand 642 states and 841 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:28,218 INFO L93 Difference]: Finished difference Result 1217 states and 1602 transitions. [2024-11-07 00:35:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:28,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:28,220 INFO L225 Difference]: With dead ends: 1217 [2024-11-07 00:35:28,220 INFO L226 Difference]: Without dead ends: 995 [2024-11-07 00:35:28,221 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:28,221 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 1819 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:28,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2880 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-07 00:35:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 642. [2024-11-07 00:35:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3548387096774193) internal successors, (840), 641 states have internal predecessors, (840), 0 states have call successors, (0), 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:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 840 transitions. [2024-11-07 00:35:28,228 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 840 transitions. Word has length 94 [2024-11-07 00:35:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:28,228 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 840 transitions. [2024-11-07 00:35:28,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 840 transitions. [2024-11-07 00:35:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:28,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:28,229 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] [2024-11-07 00:35:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:35:28,229 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash -66481708, now seen corresponding path program 1 times [2024-11-07 00:35:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530319288] [2024-11-07 00:35:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:28,511 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:28,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:28,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530319288] [2024-11-07 00:35:28,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530319288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:28,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:28,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121262718] [2024-11-07 00:35:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:28,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:28,512 INFO L87 Difference]: Start difference. First operand 642 states and 840 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:29,588 INFO L93 Difference]: Finished difference Result 1271 states and 1708 transitions. [2024-11-07 00:35:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:29,591 INFO L225 Difference]: With dead ends: 1271 [2024-11-07 00:35:29,591 INFO L226 Difference]: Without dead ends: 1185 [2024-11-07 00:35:29,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:29,592 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 6201 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6201 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:29,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6201 Valid, 2555 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2024-11-07 00:35:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 646. [2024-11-07 00:35:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3525641025641026) internal successors, (844), 645 states have internal predecessors, (844), 0 states have call successors, (0), 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:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 844 transitions. [2024-11-07 00:35:29,599 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 844 transitions. Word has length 94 [2024-11-07 00:35:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:29,599 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 844 transitions. [2024-11-07 00:35:29,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 844 transitions. [2024-11-07 00:35:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:29,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:29,600 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] [2024-11-07 00:35:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:35:29,600 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1010519460, now seen corresponding path program 1 times [2024-11-07 00:35:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830365755] [2024-11-07 00:35:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:29,783 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:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830365755] [2024-11-07 00:35:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830365755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935244220] [2024-11-07 00:35:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:29,785 INFO L87 Difference]: Start difference. First operand 646 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:30,610 INFO L93 Difference]: Finished difference Result 1045 states and 1378 transitions. [2024-11-07 00:35:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:30,612 INFO L225 Difference]: With dead ends: 1045 [2024-11-07 00:35:30,612 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:30,613 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:30,613 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 3570 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3570 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:30,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3570 Valid, 3066 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 646. [2024-11-07 00:35:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3509615384615385) internal successors, (843), 645 states have internal predecessors, (843), 0 states have call successors, (0), 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:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 843 transitions. [2024-11-07 00:35:30,619 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 843 transitions. Word has length 94 [2024-11-07 00:35:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:30,619 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 843 transitions. [2024-11-07 00:35:30,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 843 transitions. [2024-11-07 00:35:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:30,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:30,620 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] [2024-11-07 00:35:30,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:35:30,620 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash -4191139, now seen corresponding path program 1 times [2024-11-07 00:35:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338318897] [2024-11-07 00:35:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:30,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:35:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338318897] [2024-11-07 00:35:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338318897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43632768] [2024-11-07 00:35:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:30,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:30,878 INFO L87 Difference]: Start difference. First operand 646 states and 843 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:31,919 INFO L93 Difference]: Finished difference Result 1267 states and 1703 transitions. [2024-11-07 00:35:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:31,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:31,923 INFO L225 Difference]: With dead ends: 1267 [2024-11-07 00:35:31,923 INFO L226 Difference]: Without dead ends: 1185 [2024-11-07 00:35:31,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:31,924 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 6229 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6229 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:31,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6229 Valid, 2536 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2024-11-07 00:35:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 650. [2024-11-07 00:35:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3487261146496816) internal successors, (847), 649 states have internal predecessors, (847), 0 states have call successors, (0), 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:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 847 transitions. [2024-11-07 00:35:31,932 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 847 transitions. Word has length 94 [2024-11-07 00:35:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 847 transitions. [2024-11-07 00:35:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 847 transitions. [2024-11-07 00:35:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:31,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:31,933 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] [2024-11-07 00:35:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:35:31,933 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1243445751, now seen corresponding path program 1 times [2024-11-07 00:35:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983699684] [2024-11-07 00:35:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:32,097 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:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:32,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983699684] [2024-11-07 00:35:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983699684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:32,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092939585] [2024-11-07 00:35:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:32,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:32,098 INFO L87 Difference]: Start difference. First operand 650 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:32,788 INFO L93 Difference]: Finished difference Result 1090 states and 1438 transitions. [2024-11-07 00:35:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:32,789 INFO L225 Difference]: With dead ends: 1090 [2024-11-07 00:35:32,789 INFO L226 Difference]: Without dead ends: 991 [2024-11-07 00:35:32,790 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:32,790 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 2965 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 2570 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.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:32,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 2570 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-07 00:35:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 650. [2024-11-07 00:35:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3471337579617835) internal successors, (846), 649 states have internal predecessors, (846), 0 states have call successors, (0), 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:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 846 transitions. [2024-11-07 00:35:32,795 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 846 transitions. Word has length 94 [2024-11-07 00:35:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:32,795 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 846 transitions. [2024-11-07 00:35:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 846 transitions. [2024-11-07 00:35:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:32,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:32,796 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] [2024-11-07 00:35:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:35:32,796 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:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -472603347, now seen corresponding path program 1 times [2024-11-07 00:35:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996084609] [2024-11-07 00:35:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:32,965 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:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996084609] [2024-11-07 00:35:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996084609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055355166] [2024-11-07 00:35:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:32,966 INFO L87 Difference]: Start difference. First operand 650 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:33,717 INFO L93 Difference]: Finished difference Result 1045 states and 1375 transitions. [2024-11-07 00:35:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:33,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:33,719 INFO L225 Difference]: With dead ends: 1045 [2024-11-07 00:35:33,719 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:33,719 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:33,720 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 3636 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3636 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:33,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3636 Valid, 2904 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 650. [2024-11-07 00:35:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3455414012738853) internal successors, (845), 649 states have internal predecessors, (845), 0 states have call successors, (0), 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:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 845 transitions. [2024-11-07 00:35:33,734 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 845 transitions. Word has length 94 [2024-11-07 00:35:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 845 transitions. [2024-11-07 00:35:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 845 transitions. [2024-11-07 00:35:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:33,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:33,735 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] [2024-11-07 00:35:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:35:33,735 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1387862169, now seen corresponding path program 1 times [2024-11-07 00:35:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306081568] [2024-11-07 00:35:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:33,986 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:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306081568] [2024-11-07 00:35:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306081568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117529080] [2024-11-07 00:35:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:33,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:33,987 INFO L87 Difference]: Start difference. First operand 650 states and 845 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:35,189 INFO L93 Difference]: Finished difference Result 1361 states and 1831 transitions. [2024-11-07 00:35:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:35,192 INFO L225 Difference]: With dead ends: 1361 [2024-11-07 00:35:35,192 INFO L226 Difference]: Without dead ends: 1253 [2024-11-07 00:35:35,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:35,193 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 5385 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5385 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:35,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5385 Valid, 3289 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:35:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-07 00:35:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 654. [2024-11-07 00:35:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3433544303797469) internal successors, (849), 653 states have internal predecessors, (849), 0 states have call successors, (0), 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:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 849 transitions. [2024-11-07 00:35:35,199 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 849 transitions. Word has length 94 [2024-11-07 00:35:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 849 transitions. [2024-11-07 00:35:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 849 transitions. [2024-11-07 00:35:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:35:35,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:35,200 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] [2024-11-07 00:35:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:35:35,200 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1262668072, now seen corresponding path program 1 times [2024-11-07 00:35:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506879854] [2024-11-07 00:35:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:35,346 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:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506879854] [2024-11-07 00:35:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506879854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:35,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:35,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98633678] [2024-11-07 00:35:35,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:35,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:35,347 INFO L87 Difference]: Start difference. First operand 654 states and 849 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:35,949 INFO L93 Difference]: Finished difference Result 1022 states and 1326 transitions. [2024-11-07 00:35:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:35,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 00:35:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:35,951 INFO L225 Difference]: With dead ends: 1022 [2024-11-07 00:35:35,951 INFO L226 Difference]: Without dead ends: 943 [2024-11-07 00:35:35,952 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:35,952 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 2189 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:35,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 1997 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-07 00:35:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 654. [2024-11-07 00:35:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3417721518987342) internal successors, (848), 653 states have internal predecessors, (848), 0 states have call successors, (0), 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:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 848 transitions. [2024-11-07 00:35:35,957 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 848 transitions. Word has length 94 [2024-11-07 00:35:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 848 transitions. [2024-11-07 00:35:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 848 transitions. [2024-11-07 00:35:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:35,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:35,958 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:35:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:35:35,958 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -748154859, now seen corresponding path program 1 times [2024-11-07 00:35:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:35,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538992793] [2024-11-07 00:35:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:36,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:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538992793] [2024-11-07 00:35:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538992793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826362651] [2024-11-07 00:35:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:36,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:36,104 INFO L87 Difference]: Start difference. First operand 654 states and 848 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:35:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:36,815 INFO L93 Difference]: Finished difference Result 1151 states and 1512 transitions. [2024-11-07 00:35:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:36,815 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:35:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:36,817 INFO L225 Difference]: With dead ends: 1151 [2024-11-07 00:35:36,817 INFO L226 Difference]: Without dead ends: 998 [2024-11-07 00:35:36,817 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:36,817 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 3201 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:36,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3201 Valid, 2891 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-07 00:35:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 650. [2024-11-07 00:35:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3423566878980893) internal successors, (843), 649 states have internal predecessors, (843), 0 states have call successors, (0), 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:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 843 transitions. [2024-11-07 00:35:36,823 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 843 transitions. Word has length 95 [2024-11-07 00:35:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 843 transitions. [2024-11-07 00:35:36,823 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:35:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 843 transitions. [2024-11-07 00:35:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:36,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:36,824 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:35:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:35:36,824 INFO L396 AbstractCegarLoop]: === Iteration 36 === 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:36,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2144015537, now seen corresponding path program 1 times [2024-11-07 00:35:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330337170] [2024-11-07 00:35:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:36,970 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:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:36,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330337170] [2024-11-07 00:35:36,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330337170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:36,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:36,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794838219] [2024-11-07 00:35:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:36,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:36,971 INFO L87 Difference]: Start difference. First operand 650 states and 843 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:35:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:37,645 INFO L93 Difference]: Finished difference Result 1049 states and 1375 transitions. [2024-11-07 00:35:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:37,646 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:35:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:37,647 INFO L225 Difference]: With dead ends: 1049 [2024-11-07 00:35:37,647 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:37,648 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:37,648 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 1981 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:37,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 2428 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 646. [2024-11-07 00:35:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3429487179487178) internal successors, (838), 645 states have internal predecessors, (838), 0 states have call successors, (0), 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:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 838 transitions. [2024-11-07 00:35:37,653 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 838 transitions. Word has length 95 [2024-11-07 00:35:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:37,653 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 838 transitions. [2024-11-07 00:35:37,653 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:35:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 838 transitions. [2024-11-07 00:35:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:37,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:37,654 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:35:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:35:37,654 INFO L396 AbstractCegarLoop]: === Iteration 37 === 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:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1517880925, now seen corresponding path program 1 times [2024-11-07 00:35:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299473686] [2024-11-07 00:35:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:37,808 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:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299473686] [2024-11-07 00:35:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299473686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625298951] [2024-11-07 00:35:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:37,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:37,810 INFO L87 Difference]: Start difference. First operand 646 states and 838 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:35:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:38,508 INFO L93 Difference]: Finished difference Result 1045 states and 1371 transitions. [2024-11-07 00:35:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:38,508 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:35:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:38,510 INFO L225 Difference]: With dead ends: 1045 [2024-11-07 00:35:38,510 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:38,510 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:38,511 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 2943 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2943 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:38,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2943 Valid, 2448 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3435483870967742) internal successors, (833), 641 states have internal predecessors, (833), 0 states have call successors, (0), 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:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2024-11-07 00:35:38,516 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 95 [2024-11-07 00:35:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:38,516 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2024-11-07 00:35:38,516 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:35:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2024-11-07 00:35:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:38,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:38,517 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:35:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:35:38,517 INFO L396 AbstractCegarLoop]: === Iteration 38 === 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:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1778839813, now seen corresponding path program 1 times [2024-11-07 00:35:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:38,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065038843] [2024-11-07 00:35:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:38,704 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:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065038843] [2024-11-07 00:35:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065038843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186369979] [2024-11-07 00:35:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:38,706 INFO L87 Difference]: Start difference. First operand 642 states and 833 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:35:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:39,457 INFO L93 Difference]: Finished difference Result 1044 states and 1369 transitions. [2024-11-07 00:35:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:39,458 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:35:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:39,459 INFO L225 Difference]: With dead ends: 1044 [2024-11-07 00:35:39,459 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:39,459 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:39,460 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 3591 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:39,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 2956 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3419354838709678) internal successors, (832), 641 states have internal predecessors, (832), 0 states have call successors, (0), 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:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2024-11-07 00:35:39,466 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 95 [2024-11-07 00:35:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:39,466 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2024-11-07 00:35:39,467 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:35:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2024-11-07 00:35:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:39,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:39,467 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:35:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:35:39,467 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:39,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1628396825, now seen corresponding path program 1 times [2024-11-07 00:35:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:39,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885481870] [2024-11-07 00:35:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:39,620 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:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885481870] [2024-11-07 00:35:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885481870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383929538] [2024-11-07 00:35:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:39,621 INFO L87 Difference]: Start difference. First operand 642 states and 832 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:35:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:40,234 INFO L93 Difference]: Finished difference Result 1010 states and 1308 transitions. [2024-11-07 00:35:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:40,234 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:35:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:40,235 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 00:35:40,235 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:40,236 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:40,236 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 3187 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3187 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:40,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3187 Valid, 2072 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2024-11-07 00:35:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3403225806451613) internal successors, (831), 641 states have internal predecessors, (831), 0 states have call successors, (0), 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:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 831 transitions. [2024-11-07 00:35:40,241 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 831 transitions. Word has length 95 [2024-11-07 00:35:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:40,241 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 831 transitions. [2024-11-07 00:35:40,242 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:35:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 831 transitions. [2024-11-07 00:35:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:35:40,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:40,242 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:35:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:35:40,242 INFO L396 AbstractCegarLoop]: === Iteration 40 === 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:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -130502286, now seen corresponding path program 1 times [2024-11-07 00:35:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635710478] [2024-11-07 00:35:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:40,392 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:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635710478] [2024-11-07 00:35:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635710478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293254524] [2024-11-07 00:35:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:40,394 INFO L87 Difference]: Start difference. First operand 642 states and 831 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:35:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:41,138 INFO L93 Difference]: Finished difference Result 1083 states and 1418 transitions. [2024-11-07 00:35:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:41,139 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:35:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:41,140 INFO L225 Difference]: With dead ends: 1083 [2024-11-07 00:35:41,140 INFO L226 Difference]: Without dead ends: 975 [2024-11-07 00:35:41,141 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:41,141 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 2556 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:41,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 2985 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-07 00:35:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2024-11-07 00:35:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 637 states have internal predecessors, (826), 0 states have call successors, (0), 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:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 826 transitions. [2024-11-07 00:35:41,146 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 826 transitions. Word has length 95 [2024-11-07 00:35:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 826 transitions. [2024-11-07 00:35:41,146 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:35:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 826 transitions. [2024-11-07 00:35:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:41,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:41,147 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:35:41,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:35:41,147 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:41,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1915466444, now seen corresponding path program 1 times [2024-11-07 00:35:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:41,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751339341] [2024-11-07 00:35:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:41,314 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:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751339341] [2024-11-07 00:35:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751339341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984959561] [2024-11-07 00:35:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:41,315 INFO L87 Difference]: Start difference. First operand 638 states and 826 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:35:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:42,080 INFO L93 Difference]: Finished difference Result 1050 states and 1370 transitions. [2024-11-07 00:35:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:42,080 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:35:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:42,082 INFO L225 Difference]: With dead ends: 1050 [2024-11-07 00:35:42,082 INFO L226 Difference]: Without dead ends: 959 [2024-11-07 00:35:42,082 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:42,082 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 3532 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3532 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:42,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3532 Valid, 3060 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-07 00:35:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2024-11-07 00:35:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3392857142857142) internal successors, (825), 637 states have internal predecessors, (825), 0 states have call successors, (0), 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:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 825 transitions. [2024-11-07 00:35:42,087 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 825 transitions. Word has length 96 [2024-11-07 00:35:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:42,088 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 825 transitions. [2024-11-07 00:35:42,088 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:35:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 825 transitions. [2024-11-07 00:35:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:42,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:42,088 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:35:42,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 00:35:42,089 INFO L396 AbstractCegarLoop]: === Iteration 42 === 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:42,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 747746075, now seen corresponding path program 1 times [2024-11-07 00:35:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:42,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130285294] [2024-11-07 00:35:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:42,237 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:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130285294] [2024-11-07 00:35:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130285294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364165668] [2024-11-07 00:35:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:42,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:42,238 INFO L87 Difference]: Start difference. First operand 638 states and 825 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:35:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:42,892 INFO L93 Difference]: Finished difference Result 1006 states and 1301 transitions. [2024-11-07 00:35:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:42,892 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:35:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:42,894 INFO L225 Difference]: With dead ends: 1006 [2024-11-07 00:35:42,894 INFO L226 Difference]: Without dead ends: 927 [2024-11-07 00:35:42,894 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:42,894 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 2912 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:42,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2912 Valid, 2354 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-07 00:35:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 638. [2024-11-07 00:35:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3376623376623376) internal successors, (824), 637 states have internal predecessors, (824), 0 states have call successors, (0), 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:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 824 transitions. [2024-11-07 00:35:42,900 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 824 transitions. Word has length 96 [2024-11-07 00:35:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 824 transitions. [2024-11-07 00:35:42,900 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:35:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 824 transitions. [2024-11-07 00:35:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:42,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:42,901 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:35:42,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 00:35:42,901 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1896440013, now seen corresponding path program 1 times [2024-11-07 00:35:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400761922] [2024-11-07 00:35:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:43,153 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:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400761922] [2024-11-07 00:35:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400761922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208549446] [2024-11-07 00:35:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:43,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:43,155 INFO L87 Difference]: Start difference. First operand 638 states and 824 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:44,248 INFO L93 Difference]: Finished difference Result 1351 states and 1805 transitions. [2024-11-07 00:35:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:44,251 INFO L225 Difference]: With dead ends: 1351 [2024-11-07 00:35:44,251 INFO L226 Difference]: Without dead ends: 1237 [2024-11-07 00:35:44,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:44,252 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 7008 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7008 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:44,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7008 Valid, 2935 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-07 00:35:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 642. [2024-11-07 00:35:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.335483870967742) internal successors, (828), 641 states have internal predecessors, (828), 0 states have call successors, (0), 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:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 828 transitions. [2024-11-07 00:35:44,258 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 828 transitions. Word has length 96 [2024-11-07 00:35:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:44,258 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 828 transitions. [2024-11-07 00:35:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 828 transitions. [2024-11-07 00:35:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:44,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:44,259 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:35:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 00:35:44,260 INFO L396 AbstractCegarLoop]: === Iteration 44 === 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:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1185015970, now seen corresponding path program 1 times [2024-11-07 00:35:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042985290] [2024-11-07 00:35:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:44,418 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:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042985290] [2024-11-07 00:35:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042985290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335430438] [2024-11-07 00:35:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:44,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:44,419 INFO L87 Difference]: Start difference. First operand 642 states and 828 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:35:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:45,128 INFO L93 Difference]: Finished difference Result 1054 states and 1372 transitions. [2024-11-07 00:35:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:45,129 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:35:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:45,130 INFO L225 Difference]: With dead ends: 1054 [2024-11-07 00:35:45,130 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:45,130 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:45,131 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 3521 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3521 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:45,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3521 Valid, 2738 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3338709677419356) internal successors, (827), 641 states have internal predecessors, (827), 0 states have call successors, (0), 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:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 827 transitions. [2024-11-07 00:35:45,137 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 827 transitions. Word has length 96 [2024-11-07 00:35:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 827 transitions. [2024-11-07 00:35:45,137 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:35:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 827 transitions. [2024-11-07 00:35:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:45,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:45,138 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:35:45,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 00:35:45,138 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:45,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1478196549, now seen corresponding path program 1 times [2024-11-07 00:35:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:45,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802108799] [2024-11-07 00:35:45,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:45,313 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:45,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802108799] [2024-11-07 00:35:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802108799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646990739] [2024-11-07 00:35:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:45,314 INFO L87 Difference]: Start difference. First operand 642 states and 827 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:35:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:46,030 INFO L93 Difference]: Finished difference Result 1010 states and 1303 transitions. [2024-11-07 00:35:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:46,031 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:35:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:46,032 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 00:35:46,032 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:46,032 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:46,033 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 3671 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3671 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:46,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3671 Valid, 2621 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2024-11-07 00:35:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.332258064516129) internal successors, (826), 641 states have internal predecessors, (826), 0 states have call successors, (0), 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:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 826 transitions. [2024-11-07 00:35:46,037 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 826 transitions. Word has length 96 [2024-11-07 00:35:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 826 transitions. [2024-11-07 00:35:46,037 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:35:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2024-11-07 00:35:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:46,038 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:35:46,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 00:35:46,038 INFO L396 AbstractCegarLoop]: === Iteration 46 === 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:46,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1908305338, now seen corresponding path program 1 times [2024-11-07 00:35:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268005414] [2024-11-07 00:35:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:46,232 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:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:46,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268005414] [2024-11-07 00:35:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268005414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975537856] [2024-11-07 00:35:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:46,233 INFO L87 Difference]: Start difference. First operand 642 states and 826 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:35:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:47,015 INFO L93 Difference]: Finished difference Result 1007 states and 1299 transitions. [2024-11-07 00:35:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:47,015 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:35:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:47,017 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:35:47,017 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:47,017 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:47,018 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 3668 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3668 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:47,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3668 Valid, 2617 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2024-11-07 00:35:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3306451612903225) internal successors, (825), 641 states have internal predecessors, (825), 0 states have call successors, (0), 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:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 825 transitions. [2024-11-07 00:35:47,024 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 825 transitions. Word has length 96 [2024-11-07 00:35:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 825 transitions. [2024-11-07 00:35:47,024 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:35:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 825 transitions. [2024-11-07 00:35:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:47,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:47,025 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:35:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 00:35:47,025 INFO L396 AbstractCegarLoop]: === Iteration 47 === 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:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1894995014, now seen corresponding path program 1 times [2024-11-07 00:35:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712338629] [2024-11-07 00:35:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:47,220 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:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712338629] [2024-11-07 00:35:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712338629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283686885] [2024-11-07 00:35:47,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:47,221 INFO L87 Difference]: Start difference. First operand 642 states and 825 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:35:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:47,985 INFO L93 Difference]: Finished difference Result 1049 states and 1362 transitions. [2024-11-07 00:35:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:47,986 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:35:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:47,987 INFO L225 Difference]: With dead ends: 1049 [2024-11-07 00:35:47,987 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:47,988 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:47,988 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 3513 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3513 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:47,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3513 Valid, 3060 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3290322580645162) internal successors, (824), 641 states have internal predecessors, (824), 0 states have call successors, (0), 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:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 824 transitions. [2024-11-07 00:35:47,992 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 824 transitions. Word has length 96 [2024-11-07 00:35:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:47,993 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 824 transitions. [2024-11-07 00:35:47,993 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:35:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 824 transitions. [2024-11-07 00:35:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:47,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:47,993 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:35:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 00:35:47,993 INFO L396 AbstractCegarLoop]: === Iteration 48 === 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:47,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1460404217, now seen corresponding path program 1 times [2024-11-07 00:35:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:47,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000861498] [2024-11-07 00:35:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:47,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:48,145 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:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:48,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000861498] [2024-11-07 00:35:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000861498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:48,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835353457] [2024-11-07 00:35:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:48,146 INFO L87 Difference]: Start difference. First operand 642 states and 824 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:35:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:48,935 INFO L93 Difference]: Finished difference Result 980 states and 1255 transitions. [2024-11-07 00:35:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:48,935 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:35:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:48,937 INFO L225 Difference]: With dead ends: 980 [2024-11-07 00:35:48,937 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 00:35:48,937 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:35:48,937 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 2713 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2713 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:48,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2713 Valid, 3045 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 00:35:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2024-11-07 00:35:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3274193548387097) internal successors, (823), 641 states have internal predecessors, (823), 0 states have call successors, (0), 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:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2024-11-07 00:35:48,942 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 96 [2024-11-07 00:35:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:48,942 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2024-11-07 00:35:48,943 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:35:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2024-11-07 00:35:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:48,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:48,943 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:35:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 00:35:48,944 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1202808302, now seen corresponding path program 1 times [2024-11-07 00:35:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449506976] [2024-11-07 00:35:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:49,118 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:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449506976] [2024-11-07 00:35:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449506976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:49,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729148818] [2024-11-07 00:35:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:49,119 INFO L87 Difference]: Start difference. First operand 642 states and 823 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:35:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:49,813 INFO L93 Difference]: Finished difference Result 936 states and 1188 transitions. [2024-11-07 00:35:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:49,813 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:35:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:49,815 INFO L225 Difference]: With dead ends: 936 [2024-11-07 00:35:49,815 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:49,815 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:49,815 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 3619 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3619 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:49,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3619 Valid, 2705 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2024-11-07 00:35:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 641 states have internal predecessors, (822), 0 states have call successors, (0), 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:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2024-11-07 00:35:49,820 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 96 [2024-11-07 00:35:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:49,820 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2024-11-07 00:35:49,820 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:35:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2024-11-07 00:35:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:49,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:49,820 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:35:49,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 00:35:49,821 INFO L396 AbstractCegarLoop]: === Iteration 50 === 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:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -263649479, now seen corresponding path program 1 times [2024-11-07 00:35:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017416] [2024-11-07 00:35:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:50,072 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:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017416] [2024-11-07 00:35:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995600349] [2024-11-07 00:35:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:50,073 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:51,093 INFO L93 Difference]: Finished difference Result 1118 states and 1453 transitions. [2024-11-07 00:35:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:51,096 INFO L225 Difference]: With dead ends: 1118 [2024-11-07 00:35:51,096 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:35:51,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:51,096 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 7205 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7205 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:51,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7205 Valid, 2668 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:35:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 646. [2024-11-07 00:35:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3237179487179487) internal successors, (826), 645 states have internal predecessors, (826), 0 states have call successors, (0), 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:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 826 transitions. [2024-11-07 00:35:51,101 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 826 transitions. Word has length 96 [2024-11-07 00:35:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:51,101 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 826 transitions. [2024-11-07 00:35:51,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 826 transitions. [2024-11-07 00:35:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:51,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:51,102 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:35:51,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 00:35:51,102 INFO L396 AbstractCegarLoop]: === Iteration 51 === 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:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -375617371, now seen corresponding path program 1 times [2024-11-07 00:35:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229601880] [2024-11-07 00:35:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:51,268 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:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229601880] [2024-11-07 00:35:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229601880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:51,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938728201] [2024-11-07 00:35:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:51,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:51,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:51,269 INFO L87 Difference]: Start difference. First operand 646 states and 826 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:35:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:51,966 INFO L93 Difference]: Finished difference Result 1007 states and 1294 transitions. [2024-11-07 00:35:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:51,966 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:35:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:51,968 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:35:51,968 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:51,968 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:51,968 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 3620 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3620 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:51,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3620 Valid, 2693 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 646. [2024-11-07 00:35:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3221153846153846) internal successors, (825), 645 states have internal predecessors, (825), 0 states have call successors, (0), 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:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 825 transitions. [2024-11-07 00:35:51,973 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 825 transitions. Word has length 96 [2024-11-07 00:35:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:51,973 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 825 transitions. [2024-11-07 00:35:51,973 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:35:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 825 transitions. [2024-11-07 00:35:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:51,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:51,974 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:35:51,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 00:35:51,974 INFO L396 AbstractCegarLoop]: === Iteration 52 === 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:51,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1470891933, now seen corresponding path program 1 times [2024-11-07 00:35:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196040686] [2024-11-07 00:35:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:52,156 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:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196040686] [2024-11-07 00:35:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196040686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:52,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911088902] [2024-11-07 00:35:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:52,157 INFO L87 Difference]: Start difference. First operand 646 states and 825 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:35:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:52,759 INFO L93 Difference]: Finished difference Result 1007 states and 1293 transitions. [2024-11-07 00:35:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:52,760 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:35:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:52,761 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:35:52,761 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:52,762 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:52,762 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 3578 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3578 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:52,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3578 Valid, 2254 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:35:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 646. [2024-11-07 00:35:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3205128205128205) internal successors, (824), 645 states have internal predecessors, (824), 0 states have call successors, (0), 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:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 824 transitions. [2024-11-07 00:35:52,767 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 824 transitions. Word has length 96 [2024-11-07 00:35:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 824 transitions. [2024-11-07 00:35:52,767 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:35:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 824 transitions. [2024-11-07 00:35:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:52,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:52,768 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:35:52,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 00:35:52,768 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:35:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 215032534, now seen corresponding path program 1 times [2024-11-07 00:35:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494238475] [2024-11-07 00:35:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:52,907 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:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494238475] [2024-11-07 00:35:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494238475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018366971] [2024-11-07 00:35:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:52,908 INFO L87 Difference]: Start difference. First operand 646 states and 824 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:35:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:53,553 INFO L93 Difference]: Finished difference Result 1053 states and 1357 transitions. [2024-11-07 00:35:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:35:53,553 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:35:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:53,554 INFO L225 Difference]: With dead ends: 1053 [2024-11-07 00:35:53,554 INFO L226 Difference]: Without dead ends: 967 [2024-11-07 00:35:53,555 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:53,555 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 2852 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 2552 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.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:53,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 2552 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-07 00:35:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 646. [2024-11-07 00:35:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3189102564102564) internal successors, (823), 645 states have internal predecessors, (823), 0 states have call successors, (0), 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:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 823 transitions. [2024-11-07 00:35:53,560 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 823 transitions. Word has length 96 [2024-11-07 00:35:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:53,560 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 823 transitions. [2024-11-07 00:35:53,560 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:35:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 823 transitions. [2024-11-07 00:35:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:53,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:53,560 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:35:53,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 00:35:53,560 INFO L396 AbstractCegarLoop]: === Iteration 54 === 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:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 285754867, now seen corresponding path program 1 times [2024-11-07 00:35:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526915058] [2024-11-07 00:35:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:53,799 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:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526915058] [2024-11-07 00:35:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526915058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793728680] [2024-11-07 00:35:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:53,800 INFO L87 Difference]: Start difference. First operand 646 states and 823 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:54,747 INFO L93 Difference]: Finished difference Result 1189 states and 1557 transitions. [2024-11-07 00:35:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:54,749 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:35:54,749 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:35:54,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:54,749 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 7180 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7180 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:54,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7180 Valid, 2380 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:35:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:35:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 650. [2024-11-07 00:35:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3168789808917198) internal successors, (827), 649 states have internal predecessors, (827), 0 states have call successors, (0), 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:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 827 transitions. [2024-11-07 00:35:54,754 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 827 transitions. Word has length 96 [2024-11-07 00:35:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 827 transitions. [2024-11-07 00:35:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 827 transitions. [2024-11-07 00:35:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:54,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:54,755 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:35:54,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 00:35:54,755 INFO L396 AbstractCegarLoop]: === Iteration 55 === 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:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -236226230, now seen corresponding path program 1 times [2024-11-07 00:35:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29298180] [2024-11-07 00:35:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:54,889 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:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29298180] [2024-11-07 00:35:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29298180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806250556] [2024-11-07 00:35:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:54,890 INFO L87 Difference]: Start difference. First operand 650 states and 827 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:35:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:55,531 INFO L93 Difference]: Finished difference Result 1007 states and 1290 transitions. [2024-11-07 00:35:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:35:55,531 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:35:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:55,532 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:35:55,532 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:35:55,533 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:55,533 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 1923 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:55,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 2478 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:35:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:35:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 650. [2024-11-07 00:35:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3152866242038217) internal successors, (826), 649 states have internal predecessors, (826), 0 states have call successors, (0), 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:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 826 transitions. [2024-11-07 00:35:55,537 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 826 transitions. Word has length 96 [2024-11-07 00:35:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:55,537 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 826 transitions. [2024-11-07 00:35:55,537 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:35:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 826 transitions. [2024-11-07 00:35:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:55,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:55,538 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:35:55,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 00:35:55,538 INFO L396 AbstractCegarLoop]: === Iteration 56 === 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:55,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1906062599, now seen corresponding path program 1 times [2024-11-07 00:35:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356388995] [2024-11-07 00:35:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:55,772 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:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356388995] [2024-11-07 00:35:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356388995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205666351] [2024-11-07 00:35:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:55,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:55,773 INFO L87 Difference]: Start difference. First operand 650 states and 826 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:56,889 INFO L93 Difference]: Finished difference Result 1118 states and 1447 transitions. [2024-11-07 00:35:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:56,891 INFO L225 Difference]: With dead ends: 1118 [2024-11-07 00:35:56,891 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:35:56,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:56,891 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 6135 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6135 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:56,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6135 Valid, 3141 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:35:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 654. [2024-11-07 00:35:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3132911392405062) internal successors, (830), 653 states have internal predecessors, (830), 0 states have call successors, (0), 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:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 830 transitions. [2024-11-07 00:35:56,896 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 830 transitions. Word has length 96 [2024-11-07 00:35:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:56,896 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 830 transitions. [2024-11-07 00:35:56,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 830 transitions. [2024-11-07 00:35:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:56,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:56,897 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:35:56,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 00:35:56,897 INFO L396 AbstractCegarLoop]: === Iteration 57 === 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:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1010630433, now seen corresponding path program 1 times [2024-11-07 00:35:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849215253] [2024-11-07 00:35:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:57,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:35:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849215253] [2024-11-07 00:35:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849215253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419792816] [2024-11-07 00:35:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:57,131 INFO L87 Difference]: Start difference. First operand 654 states and 830 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:58,139 INFO L93 Difference]: Finished difference Result 1189 states and 1554 transitions. [2024-11-07 00:35:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:58,141 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:35:58,141 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:35:58,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:58,141 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 6225 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6225 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:58,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6225 Valid, 2585 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:35:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:35:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 658. [2024-11-07 00:35:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 636 states have (on average 1.3113207547169812) internal successors, (834), 657 states have internal predecessors, (834), 0 states have call successors, (0), 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:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 834 transitions. [2024-11-07 00:35:58,147 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 834 transitions. Word has length 96 [2024-11-07 00:35:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 834 transitions. [2024-11-07 00:35:58,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 834 transitions. [2024-11-07 00:35:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:58,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:58,148 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:35:58,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 00:35:58,149 INFO L396 AbstractCegarLoop]: === Iteration 58 === 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:58,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1893367864, now seen corresponding path program 1 times [2024-11-07 00:35:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658909156] [2024-11-07 00:35:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:58,420 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:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658909156] [2024-11-07 00:35:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658909156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:35:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409107216] [2024-11-07 00:35:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:35:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:35:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:35:58,421 INFO L87 Difference]: Start difference. First operand 658 states and 834 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:35:59,525 INFO L93 Difference]: Finished difference Result 1189 states and 1553 transitions. [2024-11-07 00:35:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:35:59,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:35:59,526 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:35:59,526 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:35:59,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:35:59,527 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 6172 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6172 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:35:59,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6172 Valid, 3117 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:35:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:35:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 662. [2024-11-07 00:35:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.309375) internal successors, (838), 661 states have internal predecessors, (838), 0 states have call successors, (0), 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:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 838 transitions. [2024-11-07 00:35:59,531 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 838 transitions. Word has length 96 [2024-11-07 00:35:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:35:59,531 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 838 transitions. [2024-11-07 00:35:59,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:35:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 838 transitions. [2024-11-07 00:35:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:35:59,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:35:59,532 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:35:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-07 00:35:59,532 INFO L396 AbstractCegarLoop]: === Iteration 59 === 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:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:35:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 166686020, now seen corresponding path program 1 times [2024-11-07 00:35:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:35:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294235506] [2024-11-07 00:35:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:35:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:35:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:35:59,669 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:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:35:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294235506] [2024-11-07 00:35:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294235506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:35:59,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:35:59,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:35:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305358744] [2024-11-07 00:35:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:35:59,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:35:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:35:59,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:35:59,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:35:59,670 INFO L87 Difference]: Start difference. First operand 662 states and 838 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:36:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:00,280 INFO L93 Difference]: Finished difference Result 1010 states and 1289 transitions. [2024-11-07 00:36:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:36:00,280 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:36:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:00,281 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 00:36:00,281 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:36:00,282 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:36:00,282 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 2026 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:00,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 2241 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:36:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:36:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 662. [2024-11-07 00:36:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.3078125) internal successors, (837), 661 states have internal predecessors, (837), 0 states have call successors, (0), 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:36:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 837 transitions. [2024-11-07 00:36:00,286 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 837 transitions. Word has length 96 [2024-11-07 00:36:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:00,286 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 837 transitions. [2024-11-07 00:36:00,286 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:36:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 837 transitions. [2024-11-07 00:36:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:36:00,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:00,287 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:36:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-07 00:36:00,287 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1834041875, now seen corresponding path program 1 times [2024-11-07 00:36:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:00,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306605036] [2024-11-07 00:36:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:00,429 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:36:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306605036] [2024-11-07 00:36:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306605036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:00,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:00,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725407791] [2024-11-07 00:36:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:00,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:00,430 INFO L87 Difference]: Start difference. First operand 662 states and 837 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:36:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:01,077 INFO L93 Difference]: Finished difference Result 1007 states and 1284 transitions. [2024-11-07 00:36:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:36:01,078 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:36:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:01,079 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:36:01,079 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:36:01,079 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:36:01,079 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 3459 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3459 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:01,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3459 Valid, 2476 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:36:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:36:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 662. [2024-11-07 00:36:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 640 states have (on average 1.30625) internal successors, (836), 661 states have internal predecessors, (836), 0 states have call successors, (0), 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:36:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 836 transitions. [2024-11-07 00:36:01,084 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 836 transitions. Word has length 96 [2024-11-07 00:36:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:01,084 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 836 transitions. [2024-11-07 00:36:01,084 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:36:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 836 transitions. [2024-11-07 00:36:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:36:01,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:01,084 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:36:01,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-07 00:36:01,085 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:01,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1989068248, now seen corresponding path program 1 times [2024-11-07 00:36:01,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:01,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175895507] [2024-11-07 00:36:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:01,334 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:36:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:01,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175895507] [2024-11-07 00:36:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175895507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:36:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120271902] [2024-11-07 00:36:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:36:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:36:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:36:01,335 INFO L87 Difference]: Start difference. First operand 662 states and 836 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:02,451 INFO L93 Difference]: Finished difference Result 1189 states and 1549 transitions. [2024-11-07 00:36:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:36:02,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:02,453 INFO L225 Difference]: With dead ends: 1189 [2024-11-07 00:36:02,453 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 00:36:02,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:36:02,453 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 7123 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7123 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:02,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7123 Valid, 2851 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:36:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 00:36:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 666. [2024-11-07 00:36:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 644 states have (on average 1.3043478260869565) internal successors, (840), 665 states have internal predecessors, (840), 0 states have call successors, (0), 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:36:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 840 transitions. [2024-11-07 00:36:02,458 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 840 transitions. Word has length 96 [2024-11-07 00:36:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 840 transitions. [2024-11-07 00:36:02,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 840 transitions. [2024-11-07 00:36:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:36:02,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:02,459 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:36:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-07 00:36:02,460 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2075245293, now seen corresponding path program 1 times [2024-11-07 00:36:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026309233] [2024-11-07 00:36:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:02,653 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:36:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026309233] [2024-11-07 00:36:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026309233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105285979] [2024-11-07 00:36:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:02,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:02,655 INFO L87 Difference]: Start difference. First operand 666 states and 840 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:36:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:03,394 INFO L93 Difference]: Finished difference Result 1081 states and 1378 transitions. [2024-11-07 00:36:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:36:03,394 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:36:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:03,395 INFO L225 Difference]: With dead ends: 1081 [2024-11-07 00:36:03,395 INFO L226 Difference]: Without dead ends: 995 [2024-11-07 00:36:03,396 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:36:03,396 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 3477 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3477 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:03,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3477 Valid, 3060 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:36:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-07 00:36:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 666. [2024-11-07 00:36:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 644 states have (on average 1.3027950310559007) internal successors, (839), 665 states have internal predecessors, (839), 0 states have call successors, (0), 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:36:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 839 transitions. [2024-11-07 00:36:03,401 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 839 transitions. Word has length 96 [2024-11-07 00:36:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:03,401 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 839 transitions. [2024-11-07 00:36:03,401 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:36:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 839 transitions. [2024-11-07 00:36:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:36:03,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:03,402 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:36:03,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-07 00:36:03,402 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1455369821, now seen corresponding path program 1 times [2024-11-07 00:36:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:03,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828971179] [2024-11-07 00:36:03,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:03,567 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:36:03,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828971179] [2024-11-07 00:36:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828971179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:03,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665101720] [2024-11-07 00:36:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:03,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:03,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:03,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:03,568 INFO L87 Difference]: Start difference. First operand 666 states and 839 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:36:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:04,209 INFO L93 Difference]: Finished difference Result 1007 states and 1281 transitions. [2024-11-07 00:36:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:36:04,209 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:36:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:04,210 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 00:36:04,210 INFO L226 Difference]: Without dead ends: 931 [2024-11-07 00:36:04,210 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:36:04,211 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 2799 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:04,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 2511 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:36:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-07 00:36:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 666. [2024-11-07 00:36:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 644 states have (on average 1.3012422360248448) internal successors, (838), 665 states have internal predecessors, (838), 0 states have call successors, (0), 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:36:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 838 transitions. [2024-11-07 00:36:04,215 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 838 transitions. Word has length 96 [2024-11-07 00:36:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:04,215 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 838 transitions. [2024-11-07 00:36:04,215 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:36:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 838 transitions. [2024-11-07 00:36:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:36:04,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:04,216 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:36:04,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-07 00:36:04,216 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1253817221, now seen corresponding path program 1 times [2024-11-07 00:36:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543922139] [2024-11-07 00:36:04,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:04,459 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:36:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543922139] [2024-11-07 00:36:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543922139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:36:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134053221] [2024-11-07 00:36:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:04,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:36:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:36:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:36:04,460 INFO L87 Difference]: Start difference. First operand 666 states and 838 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:05,443 INFO L93 Difference]: Finished difference Result 1308 states and 1707 transitions. [2024-11-07 00:36:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:36:05,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:05,445 INFO L225 Difference]: With dead ends: 1308 [2024-11-07 00:36:05,445 INFO L226 Difference]: Without dead ends: 1217 [2024-11-07 00:36:05,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:36:05,446 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 5806 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5806 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:05,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5806 Valid, 2700 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:36:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-07 00:36:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 670. [2024-11-07 00:36:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 648 states have (on average 1.2993827160493827) internal successors, (842), 669 states have internal predecessors, (842), 0 states have call successors, (0), 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:36:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 842 transitions. [2024-11-07 00:36:05,453 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 842 transitions. Word has length 96 [2024-11-07 00:36:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:05,453 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 842 transitions. [2024-11-07 00:36:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 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:36:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 842 transitions. [2024-11-07 00:36:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:36:05,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:05,454 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:36:05,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-07 00:36:05,454 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-07 00:36:05,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash -949394130, now seen corresponding path program 1 times [2024-11-07 00:36:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:05,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459656139] [2024-11-07 00:36:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:05,613 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:36:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459656139] [2024-11-07 00:36:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459656139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:05,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:05,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487760903] [2024-11-07 00:36:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:05,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:05,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:05,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:05,614 INFO L87 Difference]: Start difference. First operand 670 states and 842 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)