./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e3838e9b0fe368810fc333620df3a05f4f501b739959aedb61fcfde88b41758 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:57:44,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:57:44,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:57:44,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:57:44,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:57:44,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:57:44,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:57:44,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:57:44,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:57:44,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:57:44,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:57:44,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:57:44,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:57:44,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:57:44,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:57:44,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:57:44,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:57:44,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:57:44,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:57:44,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:57:44,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:57:44,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:57:44,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:57:44,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:57:44,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:57:44,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:57:44,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:57:44,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:57:44,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:57:44,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:57:44,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:57:44,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:57:44,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:57:44,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:57:44,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:57:44,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:57:44,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:57:44,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e3838e9b0fe368810fc333620df3a05f4f501b739959aedb61fcfde88b41758 [2024-11-08 15:57:44,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:57:44,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:57:44,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:57:44,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:57:44,733 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:57:44,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2024-11-08 15:57:46,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:57:46,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:57:46,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2024-11-08 15:57:46,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f718ffeb/62f1060cacb34c8a98f8c74c12c6eb3a/FLAGef84545a1 [2024-11-08 15:57:47,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f718ffeb/62f1060cacb34c8a98f8c74c12c6eb3a [2024-11-08 15:57:47,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:57:47,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:57:47,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:57:47,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:57:47,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:57:47,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:57:47" (1/1) ... [2024-11-08 15:57:47,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc7dd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:47, skipping insertion in model container [2024-11-08 15:57:47,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:57:47" (1/1) ... [2024-11-08 15:57:47,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:57:48,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[93880,93893] [2024-11-08 15:57:48,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[127977,127990] [2024-11-08 15:57:48,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[184673,184686] [2024-11-08 15:57:48,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[220032,220045] [2024-11-08 15:57:48,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[229801,229814] [2024-11-08 15:57:48,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[232051,232064] [2024-11-08 15:57:48,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[249702,249715] [2024-11-08 15:57:48,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[257723,257736] [2024-11-08 15:57:48,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[288453,288466] [2024-11-08 15:57:48,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[318193,318206] [2024-11-08 15:57:48,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[406252,406265] [2024-11-08 15:57:48,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[425331,425344] [2024-11-08 15:57:48,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[445911,445924] [2024-11-08 15:57:48,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[453486,453499] [2024-11-08 15:57:48,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[457284,457297] [2024-11-08 15:57:48,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[472883,472896] [2024-11-08 15:57:48,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[488771,488784] [2024-11-08 15:57:48,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[523323,523336] [2024-11-08 15:57:48,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[617972,617985] [2024-11-08 15:57:49,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:57:49,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:57:49,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[93880,93893] [2024-11-08 15:57:49,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[127977,127990] [2024-11-08 15:57:49,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[184673,184686] [2024-11-08 15:57:49,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[220032,220045] [2024-11-08 15:57:49,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[229801,229814] [2024-11-08 15:57:49,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[232051,232064] [2024-11-08 15:57:49,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[249702,249715] [2024-11-08 15:57:49,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[257723,257736] [2024-11-08 15:57:49,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[288453,288466] [2024-11-08 15:57:49,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[318193,318206] [2024-11-08 15:57:49,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[406252,406265] [2024-11-08 15:57:49,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[425331,425344] [2024-11-08 15:57:49,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[445911,445924] [2024-11-08 15:57:49,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[453486,453499] [2024-11-08 15:57:49,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[457284,457297] [2024-11-08 15:57:49,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[472883,472896] [2024-11-08 15:57:49,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[488771,488784] [2024-11-08 15:57:49,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[523323,523336] [2024-11-08 15:57:50,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[617972,617985] [2024-11-08 15:57:50,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:57:50,166 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:57:50,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50 WrapperNode [2024-11-08 15:57:50,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:57:50,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:57:50,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:57:50,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:57:50,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,675 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31892 [2024-11-08 15:57:50,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:57:50,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:57:50,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:57:50,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:57:50,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,865 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-08 15:57:50,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:50,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:57:51,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:57:51,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:57:51,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:57:51,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (1/1) ... [2024-11-08 15:57:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:57:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:57:51,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:57:51,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:57:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:57:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:57:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:57:51,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:57:52,145 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:57:52,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:58:01,779 INFO L? ?]: Removed 6394 outVars from TransFormulas that were not future-live. [2024-11-08 15:58:01,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:58:01,855 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:58:01,855 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:58:01,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:58:01 BoogieIcfgContainer [2024-11-08 15:58:01,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:58:01,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:58:01,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:58:01,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:58:01,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:57:47" (1/3) ... [2024-11-08 15:58:01,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5003bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:58:01, skipping insertion in model container [2024-11-08 15:58:01,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:57:50" (2/3) ... [2024-11-08 15:58:01,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5003bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:58:01, skipping insertion in model container [2024-11-08 15:58:01,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:58:01" (3/3) ... [2024-11-08 15:58:01,862 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2024-11-08 15:58:01,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:58:01,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-11-08 15:58:02,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:58:02,033 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;@61cf8f87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:58:02,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-08 15:58:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 6346 states, 6326 states have (on average 1.7758457160923173) internal successors, (11234), 6345 states have internal predecessors, (11234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:58:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:02,092 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] [2024-11-08 15:58:02,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:02,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash -280850909, now seen corresponding path program 1 times [2024-11-08 15:58:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138162860] [2024-11-08 15:58:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:58:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138162860] [2024-11-08 15:58:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138162860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:02,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127062048] [2024-11-08 15:58:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:02,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:03,014 INFO L87 Difference]: Start difference. First operand has 6346 states, 6326 states have (on average 1.7758457160923173) internal successors, (11234), 6345 states have internal predecessors, (11234), 0 states have call successors, (0), 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 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:06,914 INFO L93 Difference]: Finished difference Result 9409 states and 16411 transitions. [2024-11-08 15:58:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-08 15:58:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:06,957 INFO L225 Difference]: With dead ends: 9409 [2024-11-08 15:58:06,958 INFO L226 Difference]: Without dead ends: 5984 [2024-11-08 15:58:06,971 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-08 15:58:06,975 INFO L432 NwaCegarLoop]: 4931 mSDtfsCounter, 29409 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29409 SdHoareTripleChecker+Valid, 5960 SdHoareTripleChecker+Invalid, 4592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:06,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29409 Valid, 5960 Invalid, 4592 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 15:58:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2024-11-08 15:58:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 5951. [2024-11-08 15:58:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5951 states, 5932 states have (on average 1.295515846257586) internal successors, (7685), 5950 states have internal predecessors, (7685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5951 states to 5951 states and 7685 transitions. [2024-11-08 15:58:07,149 INFO L78 Accepts]: Start accepts. Automaton has 5951 states and 7685 transitions. Word has length 78 [2024-11-08 15:58:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:07,150 INFO L471 AbstractCegarLoop]: Abstraction has 5951 states and 7685 transitions. [2024-11-08 15:58:07,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5951 states and 7685 transitions. [2024-11-08 15:58:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 15:58:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:07,160 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] [2024-11-08 15:58:07,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:58:07,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -71857781, now seen corresponding path program 1 times [2024-11-08 15:58:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216208171] [2024-11-08 15:58:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:07,407 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-08 15:58:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216208171] [2024-11-08 15:58:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216208171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220068087] [2024-11-08 15:58:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:07,411 INFO L87 Difference]: Start difference. First operand 5951 states and 7685 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:11,002 INFO L93 Difference]: Finished difference Result 11857 states and 15471 transitions. [2024-11-08 15:58:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-08 15:58:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:11,026 INFO L225 Difference]: With dead ends: 11857 [2024-11-08 15:58:11,026 INFO L226 Difference]: Without dead ends: 7978 [2024-11-08 15:58:11,033 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-08 15:58:11,034 INFO L432 NwaCegarLoop]: 3086 mSDtfsCounter, 23527 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 4550 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23527 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:11,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23527 Valid, 4112 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4550 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 15:58:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2024-11-08 15:58:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 7954. [2024-11-08 15:58:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7954 states, 7935 states have (on average 1.2995589161940768) internal successors, (10312), 7953 states have internal predecessors, (10312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 10312 transitions. [2024-11-08 15:58:11,212 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 10312 transitions. Word has length 79 [2024-11-08 15:58:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:11,213 INFO L471 AbstractCegarLoop]: Abstraction has 7954 states and 10312 transitions. [2024-11-08 15:58:11,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 10312 transitions. [2024-11-08 15:58:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:58:11,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:11,228 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] [2024-11-08 15:58:11,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:58:11,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1179108102, now seen corresponding path program 1 times [2024-11-08 15:58:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:11,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186453717] [2024-11-08 15:58:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:11,495 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-08 15:58:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186453717] [2024-11-08 15:58:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186453717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361498501] [2024-11-08 15:58:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:11,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:11,498 INFO L87 Difference]: Start difference. First operand 7954 states and 10312 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:13,842 INFO L93 Difference]: Finished difference Result 13550 states and 17555 transitions. [2024-11-08 15:58:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:13,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-08 15:58:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:13,866 INFO L225 Difference]: With dead ends: 13550 [2024-11-08 15:58:13,866 INFO L226 Difference]: Without dead ends: 8760 [2024-11-08 15:58:13,875 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-08 15:58:13,876 INFO L432 NwaCegarLoop]: 2516 mSDtfsCounter, 17883 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 3231 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17883 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:13,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17883 Valid, 3296 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3231 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 15:58:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2024-11-08 15:58:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8729. [2024-11-08 15:58:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8729 states, 8710 states have (on average 1.304247990815155) internal successors, (11360), 8728 states have internal predecessors, (11360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 11360 transitions. [2024-11-08 15:58:14,064 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 11360 transitions. Word has length 80 [2024-11-08 15:58:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 8729 states and 11360 transitions. [2024-11-08 15:58:14,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 11360 transitions. [2024-11-08 15:58:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:58:14,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:14,079 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] [2024-11-08 15:58:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:58:14,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -420988062, now seen corresponding path program 1 times [2024-11-08 15:58:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104345953] [2024-11-08 15:58:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:14,730 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-08 15:58:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104345953] [2024-11-08 15:58:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104345953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:58:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846079822] [2024-11-08 15:58:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:58:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:58:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:58:14,732 INFO L87 Difference]: Start difference. First operand 8729 states and 11360 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:19,169 INFO L93 Difference]: Finished difference Result 10732 states and 14177 transitions. [2024-11-08 15:58:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:58:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-08 15:58:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:19,198 INFO L225 Difference]: With dead ends: 10732 [2024-11-08 15:58:19,198 INFO L226 Difference]: Without dead ends: 10726 [2024-11-08 15:58:19,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:58:19,202 INFO L432 NwaCegarLoop]: 2545 mSDtfsCounter, 17618 mSDsluCounter, 9511 mSDsCounter, 0 mSdLazyCounter, 11514 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17618 SdHoareTripleChecker+Valid, 12056 SdHoareTripleChecker+Invalid, 11558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 11514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:19,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17618 Valid, 12056 Invalid, 11558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 11514 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 15:58:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2024-11-08 15:58:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 8729. [2024-11-08 15:58:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8729 states, 8710 states have (on average 1.3041331802525833) internal successors, (11359), 8728 states have internal predecessors, (11359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 11359 transitions. [2024-11-08 15:58:19,335 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 11359 transitions. Word has length 80 [2024-11-08 15:58:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 8729 states and 11359 transitions. [2024-11-08 15:58:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 11359 transitions. [2024-11-08 15:58:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:58:19,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:19,347 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] [2024-11-08 15:58:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:58:19,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash 581417844, now seen corresponding path program 1 times [2024-11-08 15:58:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:19,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902637107] [2024-11-08 15:58:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:19,536 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-08 15:58:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902637107] [2024-11-08 15:58:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902637107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547064852] [2024-11-08 15:58:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:19,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:19,537 INFO L87 Difference]: Start difference. First operand 8729 states and 11359 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:21,494 INFO L93 Difference]: Finished difference Result 18073 states and 23533 transitions. [2024-11-08 15:58:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-08 15:58:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:21,512 INFO L225 Difference]: With dead ends: 18073 [2024-11-08 15:58:21,513 INFO L226 Difference]: Without dead ends: 11729 [2024-11-08 15:58:21,521 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-08 15:58:21,522 INFO L432 NwaCegarLoop]: 2393 mSDtfsCounter, 16957 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16957 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:21,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16957 Valid, 3128 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 15:58:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2024-11-08 15:58:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 11701. [2024-11-08 15:58:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11701 states, 11682 states have (on average 1.2846259202191406) internal successors, (15007), 11700 states have internal predecessors, (15007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11701 states to 11701 states and 15007 transitions. [2024-11-08 15:58:21,680 INFO L78 Accepts]: Start accepts. Automaton has 11701 states and 15007 transitions. Word has length 80 [2024-11-08 15:58:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 11701 states and 15007 transitions. [2024-11-08 15:58:21,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11701 states and 15007 transitions. [2024-11-08 15:58:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:58:21,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:21,693 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] [2024-11-08 15:58:21,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:58:21,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1834750067, now seen corresponding path program 1 times [2024-11-08 15:58:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352704963] [2024-11-08 15:58:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:58:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:22,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352704963] [2024-11-08 15:58:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352704963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:22,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 15:58:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830596500] [2024-11-08 15:58:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:22,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:58:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:58:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:58:22,441 INFO L87 Difference]: Start difference. First operand 11701 states and 15007 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:24,139 INFO L93 Difference]: Finished difference Result 22634 states and 30471 transitions. [2024-11-08 15:58:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:58:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 15:58:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:24,169 INFO L225 Difference]: With dead ends: 22634 [2024-11-08 15:58:24,169 INFO L226 Difference]: Without dead ends: 20907 [2024-11-08 15:58:24,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:58:24,179 INFO L432 NwaCegarLoop]: 4803 mSDtfsCounter, 23925 mSDsluCounter, 17828 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23925 SdHoareTripleChecker+Valid, 22631 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:24,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23925 Valid, 22631 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:58:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20907 states. [2024-11-08 15:58:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20907 to 11592. [2024-11-08 15:58:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11592 states, 11574 states have (on average 1.2842578192500431) internal successors, (14864), 11591 states have internal predecessors, (14864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 14864 transitions. [2024-11-08 15:58:24,486 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 14864 transitions. Word has length 81 [2024-11-08 15:58:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:24,486 INFO L471 AbstractCegarLoop]: Abstraction has 11592 states and 14864 transitions. [2024-11-08 15:58:24,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 14864 transitions. [2024-11-08 15:58:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:58:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:24,497 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] [2024-11-08 15:58:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:58:24,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2058965680, now seen corresponding path program 1 times [2024-11-08 15:58:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842504265] [2024-11-08 15:58:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:24,648 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-08 15:58:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842504265] [2024-11-08 15:58:24,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842504265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:24,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117031480] [2024-11-08 15:58:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:24,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:24,650 INFO L87 Difference]: Start difference. First operand 11592 states and 14864 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:26,560 INFO L93 Difference]: Finished difference Result 23165 states and 29989 transitions. [2024-11-08 15:58:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 15:58:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:26,579 INFO L225 Difference]: With dead ends: 23165 [2024-11-08 15:58:26,580 INFO L226 Difference]: Without dead ends: 15949 [2024-11-08 15:58:26,590 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-08 15:58:26,590 INFO L432 NwaCegarLoop]: 2169 mSDtfsCounter, 15466 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15466 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:26,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15466 Valid, 2939 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 15:58:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15949 states. [2024-11-08 15:58:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15949 to 15929. [2024-11-08 15:58:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15929 states, 15911 states have (on average 1.2913707497957387) internal successors, (20547), 15928 states have internal predecessors, (20547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15929 states to 15929 states and 20547 transitions. [2024-11-08 15:58:26,789 INFO L78 Accepts]: Start accepts. Automaton has 15929 states and 20547 transitions. Word has length 81 [2024-11-08 15:58:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:26,790 INFO L471 AbstractCegarLoop]: Abstraction has 15929 states and 20547 transitions. [2024-11-08 15:58:26,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15929 states and 20547 transitions. [2024-11-08 15:58:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:58:26,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:26,803 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] [2024-11-08 15:58:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:58:26,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:26,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash -262268880, now seen corresponding path program 1 times [2024-11-08 15:58:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928946785] [2024-11-08 15:58:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:58:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928946785] [2024-11-08 15:58:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928946785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:58:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123670740] [2024-11-08 15:58:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:27,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:58:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:58:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:58:27,267 INFO L87 Difference]: Start difference. First operand 15929 states and 20547 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:31,706 INFO L93 Difference]: Finished difference Result 23366 states and 30744 transitions. [2024-11-08 15:58:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:58:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 15:58:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:31,730 INFO L225 Difference]: With dead ends: 23366 [2024-11-08 15:58:31,730 INFO L226 Difference]: Without dead ends: 19983 [2024-11-08 15:58:31,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:58:31,742 INFO L432 NwaCegarLoop]: 2100 mSDtfsCounter, 17536 mSDsluCounter, 10509 mSDsCounter, 0 mSdLazyCounter, 12436 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17536 SdHoareTripleChecker+Valid, 12609 SdHoareTripleChecker+Invalid, 12446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:31,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17536 Valid, 12609 Invalid, 12446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12436 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 15:58:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19983 states. [2024-11-08 15:58:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19983 to 15936. [2024-11-08 15:58:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15936 states, 15918 states have (on average 1.2912426184193995) internal successors, (20554), 15935 states have internal predecessors, (20554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15936 states to 15936 states and 20554 transitions. [2024-11-08 15:58:32,077 INFO L78 Accepts]: Start accepts. Automaton has 15936 states and 20554 transitions. Word has length 81 [2024-11-08 15:58:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:32,077 INFO L471 AbstractCegarLoop]: Abstraction has 15936 states and 20554 transitions. [2024-11-08 15:58:32,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15936 states and 20554 transitions. [2024-11-08 15:58:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:58:32,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:32,089 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] [2024-11-08 15:58:32,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:58:32,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:32,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash -237576773, now seen corresponding path program 1 times [2024-11-08 15:58:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682134297] [2024-11-08 15:58:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:32,190 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-08 15:58:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682134297] [2024-11-08 15:58:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682134297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:58:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008666128] [2024-11-08 15:58:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:58:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:58:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:58:32,193 INFO L87 Difference]: Start difference. First operand 15936 states and 20554 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:32,634 INFO L93 Difference]: Finished difference Result 31829 states and 41426 transitions. [2024-11-08 15:58:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:58:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 15:58:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:32,660 INFO L225 Difference]: With dead ends: 31829 [2024-11-08 15:58:32,660 INFO L226 Difference]: Without dead ends: 19547 [2024-11-08 15:58:32,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:58:32,676 INFO L432 NwaCegarLoop]: 3903 mSDtfsCounter, 3944 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3944 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:32,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3944 Valid, 4956 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19547 states. [2024-11-08 15:58:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19547 to 19518. [2024-11-08 15:58:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19518 states, 19500 states have (on average 1.2875384615384615) internal successors, (25107), 19517 states have internal predecessors, (25107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 25107 transitions. [2024-11-08 15:58:32,885 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 25107 transitions. Word has length 82 [2024-11-08 15:58:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:32,885 INFO L471 AbstractCegarLoop]: Abstraction has 19518 states and 25107 transitions. [2024-11-08 15:58:32,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 25107 transitions. [2024-11-08 15:58:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:58:32,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:32,896 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] [2024-11-08 15:58:32,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:58:32,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1592112302, now seen corresponding path program 1 times [2024-11-08 15:58:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964048577] [2024-11-08 15:58:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:33,566 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-08 15:58:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:33,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964048577] [2024-11-08 15:58:33,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964048577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:33,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 15:58:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908810663] [2024-11-08 15:58:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:33,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:58:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:58:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:58:33,568 INFO L87 Difference]: Start difference. First operand 19518 states and 25107 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:36,108 INFO L93 Difference]: Finished difference Result 29000 states and 38733 transitions. [2024-11-08 15:58:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:58:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 15:58:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:36,142 INFO L225 Difference]: With dead ends: 29000 [2024-11-08 15:58:36,142 INFO L226 Difference]: Without dead ends: 28996 [2024-11-08 15:58:36,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:58:36,153 INFO L432 NwaCegarLoop]: 3712 mSDtfsCounter, 25429 mSDsluCounter, 20539 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25429 SdHoareTripleChecker+Valid, 24251 SdHoareTripleChecker+Invalid, 4154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:36,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25429 Valid, 24251 Invalid, 4154 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 15:58:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28996 states. [2024-11-08 15:58:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28996 to 19514. [2024-11-08 15:58:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19514 states, 19497 states have (on average 1.287531415089501) internal successors, (25103), 19513 states have internal predecessors, (25103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19514 states to 19514 states and 25103 transitions. [2024-11-08 15:58:36,542 INFO L78 Accepts]: Start accepts. Automaton has 19514 states and 25103 transitions. Word has length 82 [2024-11-08 15:58:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:36,542 INFO L471 AbstractCegarLoop]: Abstraction has 19514 states and 25103 transitions. [2024-11-08 15:58:36,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19514 states and 25103 transitions. [2024-11-08 15:58:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 15:58:36,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:36,551 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] [2024-11-08 15:58:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:58:36,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:36,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 369377035, now seen corresponding path program 1 times [2024-11-08 15:58:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:36,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737615875] [2024-11-08 15:58:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:36,910 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-08 15:58:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737615875] [2024-11-08 15:58:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737615875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:36,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:58:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110514802] [2024-11-08 15:58:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:58:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:58:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:58:36,912 INFO L87 Difference]: Start difference. First operand 19514 states and 25103 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:39,965 INFO L93 Difference]: Finished difference Result 24726 states and 32004 transitions. [2024-11-08 15:58:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:58:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-08 15:58:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:39,996 INFO L225 Difference]: With dead ends: 24726 [2024-11-08 15:58:39,996 INFO L226 Difference]: Without dead ends: 24717 [2024-11-08 15:58:40,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:58:40,007 INFO L432 NwaCegarLoop]: 2140 mSDtfsCounter, 21307 mSDsluCounter, 6802 mSDsCounter, 0 mSdLazyCounter, 8237 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21307 SdHoareTripleChecker+Valid, 8942 SdHoareTripleChecker+Invalid, 8277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 8237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:40,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21307 Valid, 8942 Invalid, 8277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 8237 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 15:58:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24717 states. [2024-11-08 15:58:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24717 to 19514. [2024-11-08 15:58:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19514 states, 19497 states have (on average 1.2874801251474586) internal successors, (25102), 19513 states have internal predecessors, (25102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19514 states to 19514 states and 25102 transitions. [2024-11-08 15:58:40,251 INFO L78 Accepts]: Start accepts. Automaton has 19514 states and 25102 transitions. Word has length 83 [2024-11-08 15:58:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 19514 states and 25102 transitions. [2024-11-08 15:58:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 19514 states and 25102 transitions. [2024-11-08 15:58:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 15:58:40,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:40,260 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] [2024-11-08 15:58:40,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:58:40,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash 505173845, now seen corresponding path program 1 times [2024-11-08 15:58:40,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:40,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62059543] [2024-11-08 15:58:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:40,619 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-08 15:58:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62059543] [2024-11-08 15:58:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62059543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:58:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364172725] [2024-11-08 15:58:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:58:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:58:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:58:40,621 INFO L87 Difference]: Start difference. First operand 19514 states and 25102 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:45,294 INFO L93 Difference]: Finished difference Result 30294 states and 40148 transitions. [2024-11-08 15:58:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:58:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-08 15:58:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:45,326 INFO L225 Difference]: With dead ends: 30294 [2024-11-08 15:58:45,326 INFO L226 Difference]: Without dead ends: 25474 [2024-11-08 15:58:45,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:58:45,338 INFO L432 NwaCegarLoop]: 2164 mSDtfsCounter, 18025 mSDsluCounter, 11073 mSDsCounter, 0 mSdLazyCounter, 12215 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18025 SdHoareTripleChecker+Valid, 13237 SdHoareTripleChecker+Invalid, 12274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 12215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:45,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18025 Valid, 13237 Invalid, 12274 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 12215 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 15:58:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25474 states. [2024-11-08 15:58:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25474 to 19484. [2024-11-08 15:58:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19484 states, 19467 states have (on average 1.2876663070837828) internal successors, (25067), 19483 states have internal predecessors, (25067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19484 states to 19484 states and 25067 transitions. [2024-11-08 15:58:45,686 INFO L78 Accepts]: Start accepts. Automaton has 19484 states and 25067 transitions. Word has length 83 [2024-11-08 15:58:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:45,686 INFO L471 AbstractCegarLoop]: Abstraction has 19484 states and 25067 transitions. [2024-11-08 15:58:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19484 states and 25067 transitions. [2024-11-08 15:58:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 15:58:45,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:45,695 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] [2024-11-08 15:58:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:58:45,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1309648752, now seen corresponding path program 1 times [2024-11-08 15:58:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329038864] [2024-11-08 15:58:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:46,240 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-08 15:58:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329038864] [2024-11-08 15:58:46,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329038864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:46,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 15:58:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72502064] [2024-11-08 15:58:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:46,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:58:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:58:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:58:46,242 INFO L87 Difference]: Start difference. First operand 19484 states and 25067 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:47,849 INFO L93 Difference]: Finished difference Result 31947 states and 42781 transitions. [2024-11-08 15:58:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:58:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 15:58:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:47,885 INFO L225 Difference]: With dead ends: 31947 [2024-11-08 15:58:47,885 INFO L226 Difference]: Without dead ends: 31935 [2024-11-08 15:58:47,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:58:47,897 INFO L432 NwaCegarLoop]: 4019 mSDtfsCounter, 24320 mSDsluCounter, 17210 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24320 SdHoareTripleChecker+Valid, 21229 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:47,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24320 Valid, 21229 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:58:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31935 states. [2024-11-08 15:58:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31935 to 19477. [2024-11-08 15:58:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19477 states, 19460 states have (on average 1.2877183967112025) internal successors, (25059), 19476 states have internal predecessors, (25059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19477 states to 19477 states and 25059 transitions. [2024-11-08 15:58:48,168 INFO L78 Accepts]: Start accepts. Automaton has 19477 states and 25059 transitions. Word has length 84 [2024-11-08 15:58:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:48,168 INFO L471 AbstractCegarLoop]: Abstraction has 19477 states and 25059 transitions. [2024-11-08 15:58:48,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19477 states and 25059 transitions. [2024-11-08 15:58:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 15:58:48,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:48,177 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] [2024-11-08 15:58:48,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:58:48,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:48,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1761554934, now seen corresponding path program 1 times [2024-11-08 15:58:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437163207] [2024-11-08 15:58:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:58:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437163207] [2024-11-08 15:58:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437163207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 15:58:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107434079] [2024-11-08 15:58:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:58:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:48,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:58:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:58:48,790 INFO L87 Difference]: Start difference. First operand 19477 states and 25059 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:50,821 INFO L93 Difference]: Finished difference Result 32108 states and 43100 transitions. [2024-11-08 15:58:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:58:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 15:58:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:50,854 INFO L225 Difference]: With dead ends: 32108 [2024-11-08 15:58:50,854 INFO L226 Difference]: Without dead ends: 27285 [2024-11-08 15:58:50,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:58:50,867 INFO L432 NwaCegarLoop]: 3745 mSDtfsCounter, 34709 mSDsluCounter, 17240 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34709 SdHoareTripleChecker+Valid, 20985 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:50,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34709 Valid, 20985 Invalid, 2974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 15:58:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27285 states. [2024-11-08 15:58:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27285 to 19440. [2024-11-08 15:58:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19440 states, 19424 states have (on average 1.287994233937397) internal successors, (25018), 19439 states have internal predecessors, (25018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19440 states to 19440 states and 25018 transitions. [2024-11-08 15:58:51,115 INFO L78 Accepts]: Start accepts. Automaton has 19440 states and 25018 transitions. Word has length 84 [2024-11-08 15:58:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 19440 states and 25018 transitions. [2024-11-08 15:58:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19440 states and 25018 transitions. [2024-11-08 15:58:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 15:58:51,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:51,124 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] [2024-11-08 15:58:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:58:51,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1547876573, now seen corresponding path program 1 times [2024-11-08 15:58:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863415155] [2024-11-08 15:58:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:51,507 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-08 15:58:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863415155] [2024-11-08 15:58:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863415155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:58:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885395703] [2024-11-08 15:58:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:58:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:58:51,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:58:51,509 INFO L87 Difference]: Start difference. First operand 19440 states and 25018 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:55,622 INFO L93 Difference]: Finished difference Result 25941 states and 34705 transitions. [2024-11-08 15:58:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:58:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 15:58:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:55,646 INFO L225 Difference]: With dead ends: 25941 [2024-11-08 15:58:55,646 INFO L226 Difference]: Without dead ends: 20851 [2024-11-08 15:58:55,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:58:55,658 INFO L432 NwaCegarLoop]: 2060 mSDtfsCounter, 16922 mSDsluCounter, 10351 mSDsCounter, 0 mSdLazyCounter, 11900 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16922 SdHoareTripleChecker+Valid, 12411 SdHoareTripleChecker+Invalid, 11908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:55,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16922 Valid, 12411 Invalid, 11908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11900 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 15:58:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20851 states. [2024-11-08 15:58:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20851 to 19142. [2024-11-08 15:58:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19142 states, 19126 states have (on average 1.289187493464394) internal successors, (24657), 19141 states have internal predecessors, (24657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19142 states to 19142 states and 24657 transitions. [2024-11-08 15:58:55,881 INFO L78 Accepts]: Start accepts. Automaton has 19142 states and 24657 transitions. Word has length 84 [2024-11-08 15:58:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:55,881 INFO L471 AbstractCegarLoop]: Abstraction has 19142 states and 24657 transitions. [2024-11-08 15:58:55,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 19142 states and 24657 transitions. [2024-11-08 15:58:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 15:58:55,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:55,891 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] [2024-11-08 15:58:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:58:55,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:58:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 295666503, now seen corresponding path program 1 times [2024-11-08 15:58:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350583992] [2024-11-08 15:58:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:56,341 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-08 15:58:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350583992] [2024-11-08 15:58:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350583992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:56,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:56,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 15:58:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858454847] [2024-11-08 15:58:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:56,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:58:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:58:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:58:56,344 INFO L87 Difference]: Start difference. First operand 19142 states and 24657 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:00,573 INFO L93 Difference]: Finished difference Result 28549 states and 37960 transitions. [2024-11-08 15:59:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:59:00,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 15:59:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:00,600 INFO L225 Difference]: With dead ends: 28549 [2024-11-08 15:59:00,601 INFO L226 Difference]: Without dead ends: 23760 [2024-11-08 15:59:00,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:59:00,613 INFO L432 NwaCegarLoop]: 2135 mSDtfsCounter, 18825 mSDsluCounter, 11815 mSDsCounter, 0 mSdLazyCounter, 13088 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18825 SdHoareTripleChecker+Valid, 13950 SdHoareTripleChecker+Invalid, 13169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 13088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:00,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18825 Valid, 13950 Invalid, 13169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 13088 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 15:59:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23760 states. [2024-11-08 15:59:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23760 to 19155. [2024-11-08 15:59:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19155 states, 19139 states have (on average 1.2894090600344845) internal successors, (24678), 19154 states have internal predecessors, (24678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19155 states to 19155 states and 24678 transitions. [2024-11-08 15:59:00,862 INFO L78 Accepts]: Start accepts. Automaton has 19155 states and 24678 transitions. Word has length 85 [2024-11-08 15:59:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 19155 states and 24678 transitions. [2024-11-08 15:59:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19155 states and 24678 transitions. [2024-11-08 15:59:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 15:59:00,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:00,873 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] [2024-11-08 15:59:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:59:00,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2024-11-08 15:59:00,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -103497425, now seen corresponding path program 1 times [2024-11-08 15:59:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035379082] [2024-11-08 15:59:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:01,214 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-08 15:59:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035379082] [2024-11-08 15:59:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035379082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:59:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059199620] [2024-11-08 15:59:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:01,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:59:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:59:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:59:01,216 INFO L87 Difference]: Start difference. First operand 19155 states and 24678 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)