./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-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', '07df7c2ca2abed9bcd09481b78e93a7ff3ff9af974a044cb3d572c2018ab9c02'] 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-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 07df7c2ca2abed9bcd09481b78e93a7ff3ff9af974a044cb3d572c2018ab9c02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:36:11,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:36:11,466 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:36:11,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:36:11,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:36:11,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:36:11,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:36:11,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:36:11,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:36:11,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:36:11,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:36:11,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:36:11,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:36:11,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:36:11,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:36:11,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:36:11,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:36:11,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:36:11,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:36:11,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:36:11,507 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 -> 07df7c2ca2abed9bcd09481b78e93a7ff3ff9af974a044cb3d572c2018ab9c02 [2024-11-07 00:36:11,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:36:11,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:36:11,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:36:11,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:36:11,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:36:11,814 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:36:13,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:36:13,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:36:13,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:36:13,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d2ac47ea/e9417e47692a4b7183777e16ecae1f9f/FLAG9a649aa6e [2024-11-07 00:36:14,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d2ac47ea/e9417e47692a4b7183777e16ecae1f9f [2024-11-07 00:36:14,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:36:14,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:36:14,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:36:14,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:36:14,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:36:14,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:14" (1/1) ... [2024-11-07 00:36:14,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b43115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:14, skipping insertion in model container [2024-11-07 00:36:14,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:14" (1/1) ... [2024-11-07 00:36:14,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:36:15,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2024-11-07 00:36:15,056 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2024-11-07 00:36:15,062 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2024-11-07 00:36:15,067 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2024-11-07 00:36:15,075 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2024-11-07 00:36:15,080 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2024-11-07 00:36:15,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2024-11-07 00:36:15,098 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2024-11-07 00:36:15,102 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2024-11-07 00:36:15,107 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2024-11-07 00:36:15,116 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2024-11-07 00:36:15,135 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2024-11-07 00:36:15,139 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2024-11-07 00:36:15,144 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2024-11-07 00:36:15,156 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2024-11-07 00:36:15,168 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2024-11-07 00:36:15,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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2024-11-07 00:36:15,193 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2024-11-07 00:36:15,200 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2024-11-07 00:36:15,208 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2024-11-07 00:36:15,223 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2024-11-07 00:36:15,244 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2024-11-07 00:36:15,280 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2024-11-07 00:36:15,283 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2024-11-07 00:36:15,287 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2024-11-07 00:36:15,296 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2024-11-07 00:36:15,311 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2024-11-07 00:36:15,333 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2024-11-07 00:36:15,367 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2024-11-07 00:36:15,432 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2024-11-07 00:36:15,437 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2024-11-07 00:36:15,443 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2024-11-07 00:36:15,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2024-11-07 00:36:15,463 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2024-11-07 00:36:15,503 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2024-11-07 00:36:15,530 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2024-11-07 00:36:15,578 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2024-11-07 00:36:16,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:36:16,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:36:16,649 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2024-11-07 00:36:16,661 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2024-11-07 00:36:16,670 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2024-11-07 00:36:16,675 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2024-11-07 00:36:16,680 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2024-11-07 00:36:16,686 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2024-11-07 00:36:16,689 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2024-11-07 00:36:16,696 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2024-11-07 00:36:16,699 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2024-11-07 00:36:16,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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2024-11-07 00:36:16,709 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2024-11-07 00:36:16,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2024-11-07 00:36:16,724 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2024-11-07 00:36:16,727 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2024-11-07 00:36:16,733 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2024-11-07 00:36:16,743 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2024-11-07 00:36:16,760 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2024-11-07 00:36:16,764 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2024-11-07 00:36:16,768 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2024-11-07 00:36:16,774 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2024-11-07 00:36:16,783 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2024-11-07 00:36:16,798 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2024-11-07 00:36:16,821 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2024-11-07 00:36:16,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2024-11-07 00:36:16,830 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2024-11-07 00:36:16,836 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2024-11-07 00:36:16,847 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2024-11-07 00:36:16,865 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2024-11-07 00:36:16,894 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2024-11-07 00:36:16,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2024-11-07 00:36:16,943 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2024-11-07 00:36:16,946 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2024-11-07 00:36:16,983 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2024-11-07 00:36:16,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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2024-11-07 00:36:17,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2024-11-07 00:36:17,032 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2024-11-07 00:36:17,067 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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2024-11-07 00:36:17,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:36:17,991 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:36:17,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17 WrapperNode [2024-11-07 00:36:17,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:36:17,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:36:17,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:36:17,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:36:18,000 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:36:17" (1/1) ... [2024-11-07 00:36:18,085 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:36:17" (1/1) ... [2024-11-07 00:36:18,496 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24721 [2024-11-07 00:36:18,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:36:18,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:36:18,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:36:18,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:36:18,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:18,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:18,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:18,756 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:36:18,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:18,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:18,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:19,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:19,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:19,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:19,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:36:19,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:36:19,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:36:19,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:36:19,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (1/1) ... [2024-11-07 00:36:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:36:19,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:36:19,211 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:36:19,227 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:36:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:36:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:36:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:36:19,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:36:19,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:36:19,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:36:29,208 INFO L? ?]: Removed 3580 outVars from TransFormulas that were not future-live. [2024-11-07 00:36:29,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:36:29,290 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:36:29,291 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:36:29,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:29 BoogieIcfgContainer [2024-11-07 00:36:29,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:36:29,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:36:29,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:36:29,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:36:29,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:36:14" (1/3) ... [2024-11-07 00:36:29,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ca4b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:29, skipping insertion in model container [2024-11-07 00:36:29,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:17" (2/3) ... [2024-11-07 00:36:29,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ca4b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:29, skipping insertion in model container [2024-11-07 00:36:29,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:29" (3/3) ... [2024-11-07 00:36:29,301 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:36:29,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:36:29,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-07 00:36:29,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:36:29,453 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;@62d7eab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:36:29,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-11-07 00:36:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 3854 states, 3816 states have (on average 1.874475890985325) internal successors, (7153), 3853 states have internal predecessors, (7153), 0 states have call successors, (0), 0 states have call 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:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:36:29,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:29,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:36:29,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -150150757, now seen corresponding path program 1 times [2024-11-07 00:36:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020487484] [2024-11-07 00:36:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:30,335 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:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:30,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020487484] [2024-11-07 00:36:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020487484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168616138] [2024-11-07 00:36:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:30,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:30,373 INFO L87 Difference]: Start difference. First operand has 3854 states, 3816 states have (on average 1.874475890985325) internal successors, (7153), 3853 states have internal predecessors, (7153), 0 states have call successors, (0), 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 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:33,169 INFO L93 Difference]: Finished difference Result 6602 states and 11760 transitions. [2024-11-07 00:36:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:36:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:33,205 INFO L225 Difference]: With dead ends: 6602 [2024-11-07 00:36:33,206 INFO L226 Difference]: Without dead ends: 3827 [2024-11-07 00:36:33,216 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:36:33,218 INFO L432 NwaCegarLoop]: 3381 mSDtfsCounter, 18407 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18407 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:33,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18407 Valid, 4385 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:36:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2024-11-07 00:36:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3701. [2024-11-07 00:36:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3664 states have (on average 1.3788209606986899) internal successors, (5052), 3700 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call 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:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5052 transitions. [2024-11-07 00:36:33,399 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5052 transitions. Word has length 116 [2024-11-07 00:36:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 5052 transitions. [2024-11-07 00:36:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5052 transitions. [2024-11-07 00:36:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 00:36:33,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:33,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:36:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:36:33,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:33,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1021046553, now seen corresponding path program 1 times [2024-11-07 00:36:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522794763] [2024-11-07 00:36:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:33,768 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:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522794763] [2024-11-07 00:36:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522794763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919801206] [2024-11-07 00:36:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:33,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:33,771 INFO L87 Difference]: Start difference. First operand 3701 states and 5052 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call 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:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:35,336 INFO L93 Difference]: Finished difference Result 6314 states and 8889 transitions. [2024-11-07 00:36:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-07 00:36:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:35,349 INFO L225 Difference]: With dead ends: 6314 [2024-11-07 00:36:35,349 INFO L226 Difference]: Without dead ends: 3213 [2024-11-07 00:36:35,351 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:36:35,352 INFO L432 NwaCegarLoop]: 1756 mSDtfsCounter, 9421 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9421 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:35,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9421 Valid, 1792 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:36:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2024-11-07 00:36:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3213. [2024-11-07 00:36:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 3176 states have (on average 1.4162468513853905) internal successors, (4498), 3212 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call 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:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4498 transitions. [2024-11-07 00:36:35,412 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4498 transitions. Word has length 117 [2024-11-07 00:36:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:35,414 INFO L471 AbstractCegarLoop]: Abstraction has 3213 states and 4498 transitions. [2024-11-07 00:36:35,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call 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:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4498 transitions. [2024-11-07 00:36:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:36:35,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:35,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:36:35,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:36:35,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1704632037, now seen corresponding path program 1 times [2024-11-07 00:36:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376074679] [2024-11-07 00:36:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:35,708 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:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:35,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376074679] [2024-11-07 00:36:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376074679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:35,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:35,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600296452] [2024-11-07 00:36:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:35,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:35,710 INFO L87 Difference]: Start difference. First operand 3213 states and 4498 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call 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:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:37,215 INFO L93 Difference]: Finished difference Result 5826 states and 8333 transitions. [2024-11-07 00:36:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-07 00:36:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:37,226 INFO L225 Difference]: With dead ends: 5826 [2024-11-07 00:36:37,227 INFO L226 Difference]: Without dead ends: 3053 [2024-11-07 00:36:37,230 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:36:37,231 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 8707 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8707 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:37,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8707 Valid, 1268 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:36:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2024-11-07 00:36:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2024-11-07 00:36:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3053 states, 3016 states have (on average 1.427055702917772) internal successors, (4304), 3052 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call 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:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4304 transitions. [2024-11-07 00:36:37,286 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4304 transitions. Word has length 118 [2024-11-07 00:36:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 3053 states and 4304 transitions. [2024-11-07 00:36:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call 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:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4304 transitions. [2024-11-07 00:36:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:36:37,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:37,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:36:37,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:36:37,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 46418268, now seen corresponding path program 1 times [2024-11-07 00:36:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171036264] [2024-11-07 00:36:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:37,703 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:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171036264] [2024-11-07 00:36:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171036264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923114235] [2024-11-07 00:36:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:37,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:37,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:37,705 INFO L87 Difference]: Start difference. First operand 3053 states and 4304 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:36:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:39,003 INFO L93 Difference]: Finished difference Result 5666 states and 8137 transitions. [2024-11-07 00:36:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-07 00:36:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:39,012 INFO L225 Difference]: With dead ends: 5666 [2024-11-07 00:36:39,012 INFO L226 Difference]: Without dead ends: 2925 [2024-11-07 00:36:39,017 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:36:39,019 INFO L432 NwaCegarLoop]: 1349 mSDtfsCounter, 8338 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8338 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:39,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8338 Valid, 1401 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:36:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2024-11-07 00:36:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2925. [2024-11-07 00:36:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2888 states have (on average 1.4397506925207757) internal successors, (4158), 2924 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call 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:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4158 transitions. [2024-11-07 00:36:39,075 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4158 transitions. Word has length 119 [2024-11-07 00:36:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 2925 states and 4158 transitions. [2024-11-07 00:36:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:36:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4158 transitions. [2024-11-07 00:36:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:36:39,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:39,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, 1, 1, 1, 1, 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:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:36:39,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:39,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1481188516, now seen corresponding path program 1 times [2024-11-07 00:36:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412013357] [2024-11-07 00:36:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:39,338 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:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412013357] [2024-11-07 00:36:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412013357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920110159] [2024-11-07 00:36:39,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:39,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:39,341 INFO L87 Difference]: Start difference. First operand 2925 states and 4158 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:40,361 INFO L93 Difference]: Finished difference Result 5538 states and 7989 transitions. [2024-11-07 00:36:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-07 00:36:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:40,368 INFO L225 Difference]: With dead ends: 5538 [2024-11-07 00:36:40,368 INFO L226 Difference]: Without dead ends: 2813 [2024-11-07 00:36:40,371 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:36:40,371 INFO L432 NwaCegarLoop]: 1460 mSDtfsCounter, 8062 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8062 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:40,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8062 Valid, 1488 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:36:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2024-11-07 00:36:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2024-11-07 00:36:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2776 states have (on average 1.4538904899135447) internal successors, (4036), 2812 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call 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:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4036 transitions. [2024-11-07 00:36:40,424 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4036 transitions. Word has length 120 [2024-11-07 00:36:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:40,424 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 4036 transitions. [2024-11-07 00:36:40,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4036 transitions. [2024-11-07 00:36:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:36:40,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:40,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:36:40,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:40,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1088659095, now seen corresponding path program 1 times [2024-11-07 00:36:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:40,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655027380] [2024-11-07 00:36:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:40,661 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:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:40,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655027380] [2024-11-07 00:36:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655027380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948996440] [2024-11-07 00:36:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:40,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:40,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:40,663 INFO L87 Difference]: Start difference. First operand 2813 states and 4036 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:41,734 INFO L93 Difference]: Finished difference Result 5426 states and 7865 transitions. [2024-11-07 00:36:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-07 00:36:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:41,740 INFO L225 Difference]: With dead ends: 5426 [2024-11-07 00:36:41,740 INFO L226 Difference]: Without dead ends: 2748 [2024-11-07 00:36:41,742 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:36:41,743 INFO L432 NwaCegarLoop]: 1443 mSDtfsCounter, 7878 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7878 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:41,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7878 Valid, 1455 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:36:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2024-11-07 00:36:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2748. [2024-11-07 00:36:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2711 states have (on average 1.4625599409811878) internal successors, (3965), 2747 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call 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:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3965 transitions. [2024-11-07 00:36:41,778 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3965 transitions. Word has length 121 [2024-11-07 00:36:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 2748 states and 3965 transitions. [2024-11-07 00:36:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3965 transitions. [2024-11-07 00:36:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:36:41,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:41,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:36:41,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1122787720, now seen corresponding path program 1 times [2024-11-07 00:36:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351112044] [2024-11-07 00:36:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:41,988 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:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351112044] [2024-11-07 00:36:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351112044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142829941] [2024-11-07 00:36:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:41,991 INFO L87 Difference]: Start difference. First operand 2748 states and 3965 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call 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:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:43,223 INFO L93 Difference]: Finished difference Result 5361 states and 7792 transitions. [2024-11-07 00:36:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-07 00:36:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:43,229 INFO L225 Difference]: With dead ends: 5361 [2024-11-07 00:36:43,229 INFO L226 Difference]: Without dead ends: 2717 [2024-11-07 00:36:43,230 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:36:43,231 INFO L432 NwaCegarLoop]: 1420 mSDtfsCounter, 7763 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7763 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7763 Valid, 1440 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:36:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2024-11-07 00:36:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2717. [2024-11-07 00:36:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2680 states have (on average 1.4664179104477613) internal successors, (3930), 2716 states have internal predecessors, (3930), 0 states have call successors, (0), 0 states have call 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:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3930 transitions. [2024-11-07 00:36:43,267 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3930 transitions. Word has length 122 [2024-11-07 00:36:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:43,267 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3930 transitions. [2024-11-07 00:36:43,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call 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:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3930 transitions. [2024-11-07 00:36:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:36:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:43,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:36:43,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash -204963786, now seen corresponding path program 1 times [2024-11-07 00:36:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779322978] [2024-11-07 00:36:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:43,473 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:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779322978] [2024-11-07 00:36:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779322978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:43,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:36:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016129326] [2024-11-07 00:36:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:43,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:36:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:36:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:36:43,476 INFO L87 Difference]: Start difference. First operand 2717 states and 3930 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call 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:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:44,526 INFO L93 Difference]: Finished difference Result 5330 states and 7755 transitions. [2024-11-07 00:36:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:36:44,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-07 00:36:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:44,535 INFO L225 Difference]: With dead ends: 5330 [2024-11-07 00:36:44,535 INFO L226 Difference]: Without dead ends: 2706 [2024-11-07 00:36:44,538 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:36:44,538 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 7663 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7663 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:44,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7663 Valid, 1373 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:36:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2024-11-07 00:36:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2024-11-07 00:36:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4672161858373922) internal successors, (3916), 2705 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call 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:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3916 transitions. [2024-11-07 00:36:44,565 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3916 transitions. Word has length 123 [2024-11-07 00:36:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:44,565 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3916 transitions. [2024-11-07 00:36:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call 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:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3916 transitions. [2024-11-07 00:36:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:36:44,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:44,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:36:44,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1522376233, now seen corresponding path program 1 times [2024-11-07 00:36:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362929455] [2024-11-07 00:36:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:45,661 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:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:45,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362929455] [2024-11-07 00:36:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362929455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:36:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50352579] [2024-11-07 00:36:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:45,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:36:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:36:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:36:45,668 INFO L87 Difference]: Start difference. First operand 2706 states and 3916 transitions. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:48,910 INFO L93 Difference]: Finished difference Result 4502 states and 6498 transitions. [2024-11-07 00:36:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:36:48,911 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-07 00:36:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:48,923 INFO L225 Difference]: With dead ends: 4502 [2024-11-07 00:36:48,923 INFO L226 Difference]: Without dead ends: 4198 [2024-11-07 00:36:48,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:36:48,924 INFO L432 NwaCegarLoop]: 1410 mSDtfsCounter, 6827 mSDsluCounter, 6998 mSDsCounter, 0 mSdLazyCounter, 7253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6827 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:48,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6827 Valid, 8408 Invalid, 7266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 7253 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 00:36:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2024-11-07 00:36:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 2715. [2024-11-07 00:36:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2678 states have (on average 1.4667662434652726) internal successors, (3928), 2714 states have internal predecessors, (3928), 0 states have call successors, (0), 0 states have call 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:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3928 transitions. [2024-11-07 00:36:48,962 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3928 transitions. Word has length 124 [2024-11-07 00:36:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:48,962 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3928 transitions. [2024-11-07 00:36:48,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3928 transitions. [2024-11-07 00:36:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:36:48,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:48,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:36:48,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -115626613, now seen corresponding path program 1 times [2024-11-07 00:36:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572047193] [2024-11-07 00:36:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:49,508 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:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572047193] [2024-11-07 00:36:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572047193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:49,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:49,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600678268] [2024-11-07 00:36:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:49,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:49,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:49,511 INFO L87 Difference]: Start difference. First operand 2715 states and 3928 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:52,382 INFO L93 Difference]: Finished difference Result 4295 states and 6194 transitions. [2024-11-07 00:36:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:36:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-07 00:36:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:52,391 INFO L225 Difference]: With dead ends: 4295 [2024-11-07 00:36:52,392 INFO L226 Difference]: Without dead ends: 3706 [2024-11-07 00:36:52,393 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:52,394 INFO L432 NwaCegarLoop]: 1418 mSDtfsCounter, 11876 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 6648 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11876 SdHoareTripleChecker+Valid, 7861 SdHoareTripleChecker+Invalid, 6655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:52,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11876 Valid, 7861 Invalid, 6655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6648 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:36:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2024-11-07 00:36:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 2706. [2024-11-07 00:36:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.466841513675534) internal successors, (3915), 2705 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call 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:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3915 transitions. [2024-11-07 00:36:52,434 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3915 transitions. Word has length 124 [2024-11-07 00:36:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:52,434 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3915 transitions. [2024-11-07 00:36:52,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3915 transitions. [2024-11-07 00:36:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:36:52,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:52,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:36:52,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:52,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1896036516, now seen corresponding path program 1 times [2024-11-07 00:36:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957475214] [2024-11-07 00:36:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:52,993 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:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957475214] [2024-11-07 00:36:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957475214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:36:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857462240] [2024-11-07 00:36:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:36:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:52,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:36:52,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:36:52,995 INFO L87 Difference]: Start difference. First operand 2706 states and 3915 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:55,776 INFO L93 Difference]: Finished difference Result 4208 states and 6030 transitions. [2024-11-07 00:36:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:36:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-07 00:36:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:55,784 INFO L225 Difference]: With dead ends: 4208 [2024-11-07 00:36:55,784 INFO L226 Difference]: Without dead ends: 4010 [2024-11-07 00:36:55,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:36:55,785 INFO L432 NwaCegarLoop]: 1357 mSDtfsCounter, 6939 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 5247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6939 SdHoareTripleChecker+Valid, 5836 SdHoareTripleChecker+Invalid, 5253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:55,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6939 Valid, 5836 Invalid, 5253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5247 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:36:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2024-11-07 00:36:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 2706. [2024-11-07 00:36:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4664668415136755) internal successors, (3914), 2705 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call 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:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3914 transitions. [2024-11-07 00:36:55,816 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3914 transitions. Word has length 124 [2024-11-07 00:36:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:55,816 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3914 transitions. [2024-11-07 00:36:55,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3914 transitions. [2024-11-07 00:36:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:36:55,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:55,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, 1, 1, 1, 1, 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:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:36:55,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 553304081, now seen corresponding path program 1 times [2024-11-07 00:36:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199482890] [2024-11-07 00:36:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:56,305 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:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199482890] [2024-11-07 00:36:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199482890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:56,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 00:36:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399538779] [2024-11-07 00:36:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:56,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:36:56,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:36:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:36:56,307 INFO L87 Difference]: Start difference. First operand 2706 states and 3914 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:36:59,132 INFO L93 Difference]: Finished difference Result 4210 states and 6033 transitions. [2024-11-07 00:36:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:36:59,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-07 00:36:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:36:59,138 INFO L225 Difference]: With dead ends: 4210 [2024-11-07 00:36:59,138 INFO L226 Difference]: Without dead ends: 4006 [2024-11-07 00:36:59,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:36:59,139 INFO L432 NwaCegarLoop]: 1357 mSDtfsCounter, 12548 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 6098 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12548 SdHoareTripleChecker+Valid, 6945 SdHoareTripleChecker+Invalid, 6107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 6098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:36:59,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12548 Valid, 6945 Invalid, 6107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 6098 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:36:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2024-11-07 00:36:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 2706. [2024-11-07 00:36:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4657174971899587) internal successors, (3912), 2705 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call 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:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3912 transitions. [2024-11-07 00:36:59,173 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3912 transitions. Word has length 124 [2024-11-07 00:36:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:36:59,173 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3912 transitions. [2024-11-07 00:36:59,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3912 transitions. [2024-11-07 00:36:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:36:59,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:36:59,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:36:59,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:36:59,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:36:59,178 INFO L85 PathProgramCache]: Analyzing trace with hash -744585957, now seen corresponding path program 1 times [2024-11-07 00:36:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:36:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845743128] [2024-11-07 00:36:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:36:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:36:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:36:59,570 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:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:36:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845743128] [2024-11-07 00:36:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845743128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:36:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:36:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:36:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235413935] [2024-11-07 00:36:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:36:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:36:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:36:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:36:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:36:59,572 INFO L87 Difference]: Start difference. First operand 2706 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:01,967 INFO L93 Difference]: Finished difference Result 4458 states and 6213 transitions. [2024-11-07 00:37:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:37:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-07 00:37:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:01,975 INFO L225 Difference]: With dead ends: 4458 [2024-11-07 00:37:01,975 INFO L226 Difference]: Without dead ends: 3370 [2024-11-07 00:37:01,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:37:01,978 INFO L432 NwaCegarLoop]: 1085 mSDtfsCounter, 7892 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7892 SdHoareTripleChecker+Valid, 4314 SdHoareTripleChecker+Invalid, 5580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:01,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7892 Valid, 4314 Invalid, 5580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5577 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 00:37:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2024-11-07 00:37:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2706. [2024-11-07 00:37:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4653428250281004) internal successors, (3911), 2705 states have internal predecessors, (3911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3911 transitions. [2024-11-07 00:37:02,001 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3911 transitions. Word has length 124 [2024-11-07 00:37:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:02,001 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3911 transitions. [2024-11-07 00:37:02,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3911 transitions. [2024-11-07 00:37:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:02,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:02,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:02,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:37:02,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:02,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash 33266613, now seen corresponding path program 1 times [2024-11-07 00:37:02,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:02,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546433827] [2024-11-07 00:37:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:02,382 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:37:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546433827] [2024-11-07 00:37:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546433827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531729331] [2024-11-07 00:37:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:02,385 INFO L87 Difference]: Start difference. First operand 2706 states and 3911 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:05,097 INFO L93 Difference]: Finished difference Result 4381 states and 6323 transitions. [2024-11-07 00:37:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:37:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:05,106 INFO L225 Difference]: With dead ends: 4381 [2024-11-07 00:37:05,106 INFO L226 Difference]: Without dead ends: 4154 [2024-11-07 00:37:05,108 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:37:05,109 INFO L432 NwaCegarLoop]: 1405 mSDtfsCounter, 10644 mSDsluCounter, 4821 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10644 SdHoareTripleChecker+Valid, 6226 SdHoareTripleChecker+Invalid, 5333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:05,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10644 Valid, 6226 Invalid, 5333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:37:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2024-11-07 00:37:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2706. [2024-11-07 00:37:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.464968152866242) internal successors, (3910), 2705 states have internal predecessors, (3910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3910 transitions. [2024-11-07 00:37:05,148 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3910 transitions. Word has length 126 [2024-11-07 00:37:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3910 transitions. [2024-11-07 00:37:05,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3910 transitions. [2024-11-07 00:37:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:05,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:05,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:37:05,153 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2314701, now seen corresponding path program 1 times [2024-11-07 00:37:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202177516] [2024-11-07 00:37:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:05,562 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:37:05,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:05,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202177516] [2024-11-07 00:37:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202177516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198303268] [2024-11-07 00:37:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:05,565 INFO L87 Difference]: Start difference. First operand 2706 states and 3910 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:08,316 INFO L93 Difference]: Finished difference Result 4580 states and 6632 transitions. [2024-11-07 00:37:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:37:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:08,323 INFO L225 Difference]: With dead ends: 4580 [2024-11-07 00:37:08,324 INFO L226 Difference]: Without dead ends: 4214 [2024-11-07 00:37:08,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:37:08,325 INFO L432 NwaCegarLoop]: 1790 mSDtfsCounter, 12594 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 6628 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12594 SdHoareTripleChecker+Valid, 7819 SdHoareTripleChecker+Invalid, 6634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:08,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12594 Valid, 7819 Invalid, 6634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6628 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:37:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2024-11-07 00:37:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2024-11-07 00:37:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4645934807043837) internal successors, (3909), 2705 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3909 transitions. [2024-11-07 00:37:08,361 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3909 transitions. Word has length 126 [2024-11-07 00:37:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:08,362 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3909 transitions. [2024-11-07 00:37:08,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3909 transitions. [2024-11-07 00:37:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:08,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:08,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:37:08,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1033236109, now seen corresponding path program 1 times [2024-11-07 00:37:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021861209] [2024-11-07 00:37:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:08,714 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:37:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:08,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021861209] [2024-11-07 00:37:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021861209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321546672] [2024-11-07 00:37:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:08,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:08,715 INFO L87 Difference]: Start difference. First operand 2706 states and 3909 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:11,413 INFO L93 Difference]: Finished difference Result 4482 states and 6463 transitions. [2024-11-07 00:37:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:37:11,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:11,419 INFO L225 Difference]: With dead ends: 4482 [2024-11-07 00:37:11,419 INFO L226 Difference]: Without dead ends: 4178 [2024-11-07 00:37:11,421 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:37:11,422 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 6405 mSDsluCounter, 5289 mSDsCounter, 0 mSdLazyCounter, 5848 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6405 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:11,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6405 Valid, 6841 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5848 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:37:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2024-11-07 00:37:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2024-11-07 00:37:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4642188085425254) internal successors, (3908), 2705 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3908 transitions. [2024-11-07 00:37:11,458 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3908 transitions. Word has length 126 [2024-11-07 00:37:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:11,458 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3908 transitions. [2024-11-07 00:37:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3908 transitions. [2024-11-07 00:37:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:11,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:11,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:37:11,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:11,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1854981567, now seen corresponding path program 1 times [2024-11-07 00:37:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636165392] [2024-11-07 00:37:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:11,795 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:37:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636165392] [2024-11-07 00:37:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636165392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:11,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763493241] [2024-11-07 00:37:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:11,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:11,798 INFO L87 Difference]: Start difference. First operand 2706 states and 3908 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:14,552 INFO L93 Difference]: Finished difference Result 4618 states and 6670 transitions. [2024-11-07 00:37:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:37:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:14,556 INFO L225 Difference]: With dead ends: 4618 [2024-11-07 00:37:14,556 INFO L226 Difference]: Without dead ends: 4214 [2024-11-07 00:37:14,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:37:14,558 INFO L432 NwaCegarLoop]: 1787 mSDtfsCounter, 9214 mSDsluCounter, 6017 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9214 SdHoareTripleChecker+Valid, 7804 SdHoareTripleChecker+Invalid, 6627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:14,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9214 Valid, 7804 Invalid, 6627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6622 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:37:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2024-11-07 00:37:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2024-11-07 00:37:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.463844136380667) internal successors, (3907), 2705 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3907 transitions. [2024-11-07 00:37:14,591 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3907 transitions. Word has length 126 [2024-11-07 00:37:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:14,591 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3907 transitions. [2024-11-07 00:37:14,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3907 transitions. [2024-11-07 00:37:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:14,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:14,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:37:14,595 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2018426482, now seen corresponding path program 1 times [2024-11-07 00:37:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490508893] [2024-11-07 00:37:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:14,999 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:37:14,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490508893] [2024-11-07 00:37:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490508893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905804519] [2024-11-07 00:37:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:15,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:15,001 INFO L87 Difference]: Start difference. First operand 2706 states and 3907 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:17,759 INFO L93 Difference]: Finished difference Result 4459 states and 6438 transitions. [2024-11-07 00:37:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:37:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:17,763 INFO L225 Difference]: With dead ends: 4459 [2024-11-07 00:37:17,763 INFO L226 Difference]: Without dead ends: 4178 [2024-11-07 00:37:17,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:37:17,764 INFO L432 NwaCegarLoop]: 1722 mSDtfsCounter, 12882 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 6393 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12882 SdHoareTripleChecker+Valid, 7524 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:17,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12882 Valid, 7524 Invalid, 6400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6393 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:37:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2024-11-07 00:37:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 2706. [2024-11-07 00:37:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4634694642188086) internal successors, (3906), 2705 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3906 transitions. [2024-11-07 00:37:17,794 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3906 transitions. Word has length 126 [2024-11-07 00:37:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:17,795 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3906 transitions. [2024-11-07 00:37:17,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3906 transitions. [2024-11-07 00:37:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:17,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:17,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:37:17,799 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1182584093, now seen corresponding path program 1 times [2024-11-07 00:37:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706922230] [2024-11-07 00:37:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:18,159 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:37:18,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:18,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706922230] [2024-11-07 00:37:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706922230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:18,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:18,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:18,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036734616] [2024-11-07 00:37:18,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:18,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:18,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:18,161 INFO L87 Difference]: Start difference. First operand 2706 states and 3906 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:37:20,710 INFO L93 Difference]: Finished difference Result 4794 states and 6926 transitions. [2024-11-07 00:37:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:37:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-07 00:37:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:37:20,715 INFO L225 Difference]: With dead ends: 4794 [2024-11-07 00:37:20,715 INFO L226 Difference]: Without dead ends: 4214 [2024-11-07 00:37:20,716 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:37:20,717 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 11198 mSDsluCounter, 5871 mSDsCounter, 0 mSdLazyCounter, 6374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11198 SdHoareTripleChecker+Valid, 7607 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:37:20,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11198 Valid, 7607 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6374 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 00:37:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2024-11-07 00:37:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2706. [2024-11-07 00:37:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2669 states have (on average 1.4627201198950919) internal successors, (3904), 2705 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3904 transitions. [2024-11-07 00:37:20,755 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3904 transitions. Word has length 126 [2024-11-07 00:37:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:37:20,756 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3904 transitions. [2024-11-07 00:37:20,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:37:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3904 transitions. [2024-11-07 00:37:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:37:20,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:37:20,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:37:20,760 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-11-07 00:37:20,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:37:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -829302792, now seen corresponding path program 1 times [2024-11-07 00:37:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:37:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320874511] [2024-11-07 00:37:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:37:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:37:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:37:21,127 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:37:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:37:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320874511] [2024-11-07 00:37:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320874511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:37:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:37:21,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:37:21,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334555829] [2024-11-07 00:37:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:37:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:37:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:37:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:37:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:37:21,129 INFO L87 Difference]: Start difference. First operand 2706 states and 3904 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)